Congruence of cycle lengths and chromatic number

DOI10.1002/jgt.23034OpenAlexW4387117987MaRDI QIDQ6143384

Narda Cordero-Michel, Hortensia Galeana-Sánchez

Publication date: 24 January 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.23034

zbMATH Keywords

chromatic numberproper coloringDFS algorithm

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Coloring digraphs with forbidden cycles
• Graph coloring in linear time
• Graphs with \(k\) odd cycle lengths
• Cycle lengths and minimum degree of graphs
• Cycle lengths and chromatic number of graphs
• Cycles and new bounds for the chromatic number
• Cycles in color-critical graphs
• Circumference, chromatic number and online coloring
• A bound on the chromatic number using the longest odd cycle length
• A Theorem on n-Coloring the Points of a Linear Graph
• Diconnected Orientations and a Conjecture of Las Vergnas
• Graph Theory and Its Applications
• A Strengthening on Odd Cycles in Graphs of Given Chromatic Number
• On chromatic number of graphs and set-systems
• Nombre chromatique et plus longs chemins d'un graphe

This page was built for publication: Congruence of cycle lengths and chromatic number