Pages that link to "Item:Q1883263"
From MaRDI portal
The following pages link to Cycle lengths and chromatic number of graphs (Q1883263):
Displaying 23 items.
- Problems on cycles and colorings (Q383772) (← links)
- Coloring digraphs with forbidden cycles (Q490994) (← links)
- The extremal function for cycles of length \(\ell\) mod \(k\) (Q510312) (← links)
- Bounds for chromatic number in terms of even-girth and booksize (Q616000) (← links)
- What must and what need not be contained in a graph of uncountable chromatic number? (Q794660) (← links)
- Graphs with \(k\) odd cycle lengths (Q1196747) (← links)
- Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360) (← 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 minimum degree of graphs (Q1682209) (← links)
- Cycles in triangle-free graphs of large chromatic number (Q1743172) (← links)
- Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
- Cycle lengths in expanding graphs (Q2036619) (← links)
- Cycle lengths modulo \(k\) in expanders (Q2111188) (← links)
- Cycles and new bounds for the chromatic number (Q2111913) (← links)
- Subdivisions of four blocks cycles in digraphs with large chromatic number (Q2235256) (← links)
- Circumference, chromatic number and online coloring (Q2439828) (← links)
- Small odd cycles in 4-chromatic graphs (Q2744571) (← links)
- Cycle length parities and the chromatic number (Q3055917) (← links)
- The number of shortest cycles and the chromatic uniqueness of a graph (Q3990870) (← links)
- On the Number of Cycles in a Graph with Restricted Cycle Lengths (Q4602855) (← links)
- A Strengthening on Odd Cycles in Graphs of Given Chromatic Number (Q5157394) (← links)
- Congruence of cycle lengths and chromatic number (Q6143384) (← links)
- The chromatic number of a graph with two odd holes and an odd girth (Q6143691) (← links)
