Conditional chromatic numbers with forbidden cycles

DOI10.1016/0024-3795(94)00139-5zbMath0824.05024OpenAlexW2004472971MaRDI QIDQ1805306

Karen Casey Dargen, Kathryn Fraughnaugh

Publication date: 9 November 1995

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(94)00139-5

zbMATH Keywords

chromatic numberforbidden cyclesconditional coloringconditional chromatic number

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Extremal \(G\)-free induced subgraphs of Kneser graphs ⋮ Chromatic sums for colorings avoiding monochromatic subgraphs

Cites Work

• Arc coverings of graphs
• Parallel concepts in graph theory
• The subchromatic number of a graph
• The point-arboricity of a graph
• Graph Theory and Probability
• On generalized graph colorings
• ON UNIQUELY -G k-COLOURABLE GRAPHS
• On chromatic number of finite set-systems
• On Partitioning Planar Graphs
• The Point-Arboricity of Planar Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Conditional chromatic numbers with forbidden cycles