Cycles and new bounds for the chromatic number
From MaRDI portal
(Redirected from Publication:2111913)
Recommendations
Cites work
- scientific article; zbMATH DE number 3257176 (Why is no real title available?)
- A Theorem on n-Coloring the Points of a Linear Graph
- Circular colouring and orientation of graphs
- Circumference, chromatic number and online coloring
- Coloring digraphs with forbidden cycles
- Cycle lengths and chromatic number of 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
- Nombre chromatique et plus longs chemins d'un graphe
- On approximating the longest path in a graph
Cited in
(7)- The \(3x+1\) problem: New lower bounds on nontrivial cycle lengths
- Congruence of cycle lengths and chromatic number
- Circumference, chromatic number and online coloring
- Cycle lengths and chromatic number of graphs
- On the connection between the chromatic number of a graph and the number of cycles covering a vertex or an edge
- On the number of bounding cycles for nonlinear arrangements
- A quick way to verify if a graph is 3-colorable
This page was built for publication: Cycles and new bounds for the chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111913)