Congruence of cycle lengths and chromatic number
From MaRDI portal
Publication:6143384
Recommendations
Cites work
- A bound on the chromatic number using the longest odd cycle length
- A strengthening on odd cycles in graphs of given chromatic number
- A Theorem on n-Coloring the Points of a Linear Graph
- Circumference, chromatic number and online coloring
- Coloring digraphs with forbidden cycles
- Cycle lengths and chromatic number of graphs
- Cycle lengths and minimum degree of graphs
- Cycles and new bounds for the chromatic number
- Cycles in color-critical graphs
- Diconnected Orientations and a Conjecture of Las Vergnas
- Graph coloring in linear time
- Graph theory
- Graph theory and its applications
- Graphs with \(k\) odd cycle lengths
- scientific article; zbMATH DE number 3257176 (Why is no real title available?)
- Nombre chromatique et plus longs chemins d'un graphe
- On chromatic number of graphs and set-systems
This page was built for publication: Congruence of cycle lengths and chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6143384)