On the structure of (even hole, kite)-free graphs

DOI10.1007/s00373-018-1925-5zbMath1402.05065OpenAlexW2883056852WikidataQ129472842 ScholiaQ129472842MaRDI QIDQ1756042

Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1925-5

zbMATH Keywords

graph coloringeven-hole-free graph\(\beta \)-perfectvizing bound

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Finding a shortest even hole in polynomial time ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topics on perfect graphs
• Bisimplicial vertices in even-hole-free graphs
• Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
• Decomposition by clique separators
• A class of \(\beta\)-perfect graphs
• Graph coloring for air traffic flow management
• \(\beta\)-perfect graphs
• Even-hole-free graphs part I: Decomposition theorem
• Even-hole-free graphs part II: Recognition algorithm
• On the structure of (pan, even hole)‐free graphs
• Detecting even holes
• Frequency planning and ramifications of coloring

This page was built for publication: On the structure of (even hole, kite)-free graphs