Graph subcolorings: Complexity and algorithms

DOI10.1007/3-540-45477-2_15MaRDI QIDQ4448755zbMATH OpenFDO

Authors Jiří Fiala, Van Bang Le, Eike Seidel, Klaus Jansen

Publication date 18 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2204/22040154.htm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Graph Subcolorings: Complexity and Algorithms
• Subcolorings and the subchromatic number of a graph
• More about subcolorings
• Coloring graphs characterized by a forbidden subgraph
• More about subcolorings

Cited in

(14)

• Subcolorings and the subchromatic number of a graph
• On the algorithmic aspects of strong subcoloring
• Parameterized complexity of maximum edge colorable subgraph
• 2-subcoloring is NP-complete for planar comparability graphs
• Coloring subgraphs with restricted amounts of hues
• Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
• SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS
• More about subcolorings
• More about subcolorings
• Graph Subcolorings: Complexity and Algorithms
• On subgraphs without large components.
• The subchromatic index of graphs
• On 2-Subcolourings of Chordal Graphs
• Subcoloring of (unit) disk graphs

This page was built for publication: Graph subcolorings: Complexity and algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4448755)