Relaxed chromatic numbers of graphs

DOI10.1007/BF01202473zbMath0796.05036MaRDI QIDQ1323496

Douglas B. West, Margaret L. Weaver

Publication date: 10 May 1994

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Deciding Relaxed Two-Colourability: A Hardness Jump ⋮ On monochromatic component size for improper colourings ⋮ A note on on-line ranking number of graphs ⋮ On \(t\)-relaxed 2-distant circular coloring of graphs ⋮ Channel assignment problem and relaxed 2-distant coloring of graphs ⋮ Bounded families for the on-line \(t\)-relaxed coloring

Cites Work

• Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs
• Path chromatic numbers of graphs
• A Note on the Vertex Arboricity of a Graph
• An inequality for the chromatic number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item