The subchromatic number of a graph

DOI10.1016/0012-365X(89)90196-9zbMath0681.05033DBLPjournals/dm/AlbertsonJHL89WikidataQ56428500 ScholiaQ56428500MaRDI QIDQ1823255

Robert E. Jamison, Stephen T. Hedetniemi, Michael O. Albertson, Stephen C. Locke

Publication date: 1989

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

zbMATH Keywords

chromatic numbercomplete graphsubchromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (27)

Trees, paths, stars, caterpillars and spiders ⋮ Dynamic \(F\)-free coloring of graphs ⋮ The equivalence number of a line graph ⋮ On the approximability of the maximum interval constrained coloring problem ⋮ The existence of uniquely \(-G\) colourable graphs ⋮ The complexity of generalized graph colorings ⋮ Partitions of graphs into cographs ⋮ Generalized DP-colorings of graphs ⋮ ON UNIQUELY -G k-COLOURABLE GRAPHS ⋮ Subcolorings and the subchromatic number of a graph ⋮ Clustering powers of sparse graphs ⋮ On the readability of monotone Boolean formulae ⋮ Path-bicolorable graphs ⋮ On the algorithmic aspects of strong subcoloring ⋮ A hypocoloring model for batch scheduling ⋮ SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS ⋮ Chromatic sums for colorings avoiding monochromatic subgraphs ⋮ On 2-Subcolourings of Chordal Graphs ⋮ Conditional chromatic numbers with forbidden cycles ⋮ Minimum partition of an independence system into independent sets ⋮ Chromatic partitions of a graph ⋮ Unnamed Item ⋮ Path-Bicolorable Graphs ⋮ A sequential coloring algorithm for finite sets ⋮ Some of My Favorite Coloring Problems for Graphs and Digraphs ⋮ Coloring complexes and combinatorial Hopf monoids ⋮ The NP-completeness of (1,r)-subcolorability of cubic graphs

Cites Work

• On Ramsey theory and graphical parameters
• Parallel concepts in graph theory
• The point-arboricity of a graph
• An interpolation theorem for partitions which are complete with respect to hereditary properties
• Point partition numbers and generalized Nordhaus-Gaddum problems
• On generalized graph colorings
• Point Partition Numbers and Girth
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems
• On Partitioning Planar Graphs
• An inequality for the chromatic number of a graph
• The Point-Arboricity of Planar Graphs
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• The achromatic number of a graph
• k-Degenerate Graphs
• Brève communication. Sur le nombre chromatique $K(p, G)$ des graphes
• Colour Classes for r-Graphs
• Sur le coloriage des graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The subchromatic number of a graph