Coloring Graphs with Two Odd Cycle Lengths

DOI10.1137/15M1053773zbMath1379.05039arXiv1512.06393OpenAlexW2238816572MaRDI QIDQ4602857

Jie Ma, Bo Ning

Publication date: 7 February 2018

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

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

zbMATH Keywords

chromatic numbercritical graph3-colorabilityodd cycle length

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Colourings of graphs with two consecutive odd cycle lengths
• Non-separating induced cycles in graphs
• Graphs having circuits with at least two chords
• Graphs with \(k\) odd cycle lengths
• Cycle lengths and minimum degree of graphs
• Cycles in triangle-free graphs of large chromatic number
• Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable
• Structure and Coloring of Graphs with Only Small Odd Cycles
• The structure of k-chromatic graphs

This page was built for publication: Coloring Graphs with Two Odd Cycle Lengths