Subcolorings and the subchromatic number of a graph

DOI10.1016/S0012-365X(03)00177-8zbMath1028.05032OpenAlexW2071545958WikidataQ56428504 ScholiaQ56428504MaRDI QIDQ1412662

Chris Hartman, John G. Gimbel

Publication date: 25 November 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00177-8

zbMATH Keywords

Generalized coloringSubchromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Trees, paths, stars, caterpillars and spiders ⋮ Dynamic \(F\)-free coloring of graphs ⋮ Trees, Paths, Stars, Caterpillars and Spiders ⋮ Colorings of oriented planar graphs avoiding a monochromatic subgraph ⋮ 2-subcoloring is NP-complete for planar comparability graphs ⋮ Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs ⋮ Unnamed Item ⋮ Some defective parameters in graphs ⋮ Near-colorings: non-colorable graphs and NP-completeness ⋮ On 2-Subcolourings of Chordal Graphs ⋮ Solving Partition Problems Almost Always Requires Pushing Many Vertices Around ⋮ On star and caterpillar arboricity ⋮ Some of My Favorite Coloring Problems for Graphs and Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some simplified NP-complete graph problems
• On Ramsey theory and graphical parameters
• The complexity of \(G\)-free colourability
• The subchromatic number of a graph
• Gadget classification
• Graphs with forbidden subgraphs
• Defective coloring revisited
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Some extremal results in cochromatic and dichromatic theory
• Coloring graphs with fixed genus and girth
• 25 pretty graph colouring problems