Odd-\(K_{4}\)'s in stability critical graphs

DOI10.1016/j.disc.2009.04.029zbMath1229.05134OpenAlexW1982313251MaRDI QIDQ1045088

Wenan Zang, Zhibin Chen

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.04.029

zbMATH Keywords

stable setsubdivisionstability critical graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Unnamed Item
• Unnamed Item
• A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
• Matrices with the Edmonds-Johnson property
• Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable
• Stability critical graphs and even subdivisions of \(K_ 4\)
• An orientation theorem for graphs
• On certain polytopes associated with graphs
• A short proof of Guenin's characterization of weakly bipartite graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Homomorphisms of graphs into odd cycles
• The Graphs with All Subgraphs T-Perfect
• Strong T-Perfection of Bad-K₄ -Free Graphs
• On Indecomposable Graphs
• Totally odd \(K_4\)-subdivisions in 4-chromatic graphs

This page was built for publication: Odd-\(K_{4}\)'s in stability critical graphs