Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs

Title
Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs
Authors
Keywords
-
Journal
COMPUTER JOURNAL
Volume 58, Issue 11, Pages 3074-3088
Publisher
Oxford University Press (OUP)
Online
2015-06-09
DOI
10.1093/comjnl/bxv039

Ask authors/readers for more resources

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now