Pages that link to "Item:Q2434742"
From MaRDI portal
The following pages link to Beautiful conjectures in graph theory (Q2434742):
Displaying 16 items.
- Chords in longest cycles (Q684125) (← links)
- Long cycles in Hamiltonian graphs (Q1717607) (← links)
- Gallai's path decomposition conjecture for triangle-free planar graphs (Q1732776) (← links)
- Long cycles, heavy cycles and cycle decompositions in digraphs (Q1998760) (← links)
- The conjunction of the linear arboricity conjecture and Lovász's path partition theorem (Q2032853) (← links)
- On computing the path number of a graph (Q2132346) (← links)
- The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
- Gallai's conjecture for graphs with treewidth 3 (Q2413163) (← links)
- Spanning triangle-trees and flows of graphs (Q2657050) (← links)
- Some Conjectures and Questions in Chromatic Topological Graph Theory (Q5506783) (← links)
- Ádám's conjecture (Q6038575) (← links)
- Towards Gallai's path decomposition conjecture (Q6055934) (← links)
- A note on Seymour's second neighborhood conjecture (Q6162045) (← links)
- The problem of path decomposition for graphs with treewidth at most 4 (Q6494937) (← links)
- Gallai's path decomposition conjecture for graphs with maximum \(E\)-degree at most 3 (Q6621169) (← links)
- A conjecture generalizing Thomassen's chord conjecture in graph theory (Q6645202) (← links)
