On coloring problems with local constraints
DOI10.1016/J.ENDM.2009.11.036zbMATH Open1268.05062OpenAlexW4212987857MaRDI QIDQ5891093FDOQ5891093
Authors: Yuri Faenza, Gianpaolo Oriolo, Flavia Bonomo 
Publication date: 19 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2108/7960
Recommendations
computational complexityclique treesperfect graphsunit interval graphscomplexity resultsgraph coloring problemgraph coloring problemsplynomial time algorithmsprecoloring extension problem
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)
Cites Work
- The Complexity of Coloring Circular Arcs and Chords
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Generalized coloring for tree-like graphs
- Coloring a Family of Circular Arcs
- Precoloring extension. I: Interval graphs
- Title not available (Why is that?)
- Precoloring Extension III: Classes of Perfect Graphs
- Exploring the complexity boundary between coloring and list-coloring
- Completely separable graphs
- Approximation results for the optimum cost chromatic partition problem
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: On coloring problems with local constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5891093)
