A note on chromatic number of (cap, even hole)-free graphs

DOI10.1016/j.disc.2018.11.005zbMath1403.05053OpenAlexW2904789974WikidataQ128750144 ScholiaQ128750144MaRDI QIDQ1712540

Rong Wu, Bao-Gang Xu

Publication date: 22 January 2019

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

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

zbMATH Keywords

chromatic numberclique numberinduced even cycles

Mathematics Subject Classification ID

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

Related Items (2)

Finding a shortest even hole in polynomial time ⋮ A better upper bound on the chromatic number of (cap, even-hole)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Induced subgraphs of graphs with large chromatic number. I. Odd holes
• On rigid circuit graphs
• The strong perfect graph theorem
• Bisimplicial vertices in even-hole-free graphs
• Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• Structure and algorithms for (cap, even hole)-free graphs
• Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
• Graph Theory and Probability
• Even and odd holes in cap-free graphs
• Even-hole-free graphs: A survey

This page was built for publication: A note on chromatic number of (cap, even hole)-free graphs