Cycles and new bounds for the chromatic number

DOI10.1016/j.disc.2022.113255zbMath1506.05062OpenAlexW4309340876MaRDI QIDQ2111913

Hortensia Galeana-Sánchez, Narda Cordero-Michel, Ilan A. Goldfeder

Publication date: 17 January 2023

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

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

zbMATH Keywords

chromatic numberproper coloringDFS algorithm

Mathematics Subject Classification ID

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

Related Items (1)

Congruence of cycle lengths and chromatic number

Cites Work

• Unnamed Item
• Unnamed Item
• Coloring digraphs with forbidden cycles
• On approximating the longest path in a graph
• Graph coloring in linear time
• Graphs with \(k\) odd cycle lengths
• Circular colouring and orientation of graphs
• Cycle lengths and chromatic number of graphs
• Circumference, chromatic number and online coloring
• A Theorem on n-Coloring the Points of a Linear Graph
• Diconnected Orientations and a Conjecture of Las Vergnas
• Graph Theory and Its Applications
• Nombre chromatique et plus longs chemins d'un graphe

This page was built for publication: Cycles and new bounds for the chromatic number