|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4 occurrences of 4 keywords
|
|
|
Results
Found 7 publication records. Showing 7 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
195 | Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger |
More about Subcolorings. |
WG |
2002 |
DBLP DOI BibTeX RDF |
subcoloring, special graph classes, computational complexity, graph coloring, polynomial time algorithm |
132 | Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger |
More About Subcolorings. |
Computing |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classifications: 05C15, 05C17, 05C85 |
53 | Jirí Fiala 0001, Klaus Jansen, Van Bang Le, Eike Seidel |
Graph Subcolorings: Complexity and Algorithms. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
40 | M. A. Shalu, S. Vijayakumar, S. Devi Yamini, T. P. Sandhya 0001 |
On the algorithmic aspects of strong subcoloring. |
J. Comb. Optim. |
2018 |
DBLP DOI BibTeX RDF |
|
40 | Pascal Ochem |
2-subcoloring is NP-complete for planar comparability graphs. |
Inf. Process. Lett. |
2017 |
DBLP DOI BibTeX RDF |
|
40 | Pascal Ochem |
2-subcoloring is NP-complete for planar comparability graphs. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
26 | Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos |
The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #7 of 7 (100 per page; Change: )
|
|