Pages that link to "Item:Q2111913"
From MaRDI portal
The following pages link to Cycles and new bounds for the chromatic number (Q2111913):
Displaying 7 items.
- The \(3x+1\) problem: New lower bounds on nontrivial cycle lengths (Q685592) (← links)
- On the connection between the chromatic number of a graph and the number of cycles covering a vertex or an edge (Q1661493) (← links)
- Cycle lengths and chromatic number of graphs (Q1883263) (← links)
- Circumference, chromatic number and online coloring (Q2439828) (← links)
- On the number of bounding cycles for nonlinear arrangements (Q2707462) (← links)
- Congruence of cycle lengths and chromatic number (Q6143384) (← links)
- A quick way to verify if a graph is 3-colorable (Q6633531) (← links)