The following pages link to Problems on cycles and colorings (Q383772):
Displaying 5 items.
- Coloring digraphs with forbidden cycles (Q490994) (← links)
- Proof of Komlós's conjecture on Hamiltonian subsets (Q1689999) (← links)
- Maximising the number of induced cycles in a graph (Q2399349) (← links)
- Local Conditions for Exponentially Many Subdivisions (Q5366949) (← links)
- Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza (Q6201025) (← links)
