Some remarks on even-hole-free graphs

DOI10.37236/10772zbMath1494.05070arXiv2106.01136OpenAlexW3167276073MaRDI QIDQ2161221

Zi-Xia Song

Publication date: 4 August 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.01136

zbMATH Keywords

chromatic numberproper \(k\)-coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Erdős-Lovász Tihany conjecture and complete minors
• Lower bound of the Hadwiger number of graphs by their average degree
• Partitions and edge colourings of multigraphs
• The Erdős-Lovász tihany conjecture for quasi-line graphs
• \(K_ 5\) is the only double-critical 5-chromatic graph
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Hadwiger's conjecture for line graphs
• Claw-free graphs. VII. Quasi-line graphs
• Progress towards Nash-Williams' conjecture on triangle decompositions
• Erdős-Lovász Tihany conjecture for graphs with forbidden holes
• Coloring graphs with forbidden minors
• Homomorphiesätze für Graphen
• Über eine Eigenschaft der ebenen Komplexe
• Hadwiger’s Conjecture
• An extremal function for contractions of graphs
• Hadwiger's conjecture for quasi-line graphs
• A Relaxed Version of the Erdős–Lovász Tihany Conjecture
• Hadwiger's Conjecture for Graphs with Forbidden Holes
• On odd circuits in chromatic graphs
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: Some remarks on even-hole-free graphs