Coloring graphs with no \(\text{odd-}K_4\)

DOI10.1016/S0012-365X(97)00090-3zbMath0957.05046OpenAlexW2052769540MaRDI QIDQ1584207

Wenan Zang

Publication date: 2 November 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00090-3

zbMATH Keywords

polynomial-time algorithmcoloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
• Matrices with the Edmonds-Johnson property
• Hajos' graph-coloring conjecture: Variations and counterexamples
• An orientation theorem for graphs
• Homomorphisms of graphs into odd cycles
• A Theorem on n-Coloring the Points of a Linear Graph
• Depth-First Search and Linear Graph Algorithms