|
|
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers, pp. 68-79, 2002, Springer, 3-540-00331-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 69(3), pp. 187-203, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings, pp. 154-165, 2001, Springer, 3-540-42707-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 35(4), pp. 1312-1329, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
40 | Pascal Ochem |
2-subcoloring is NP-complete for planar comparability graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 128, pp. 46-48, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
40 | Pascal Ochem |
2-subcoloring is NP-complete for planar comparability graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1702.01283, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers, pp. 377-388, 2004, Springer, 3-540-24132-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #7 of 7 (100 per page; Change: )
|
|