Beautiful conjectures in graph theory
From MaRDI portal
Publication:2434742
DOI10.1016/j.ejc.2013.07.006zbMath1282.05206OpenAlexW1986730114WikidataQ123022467 ScholiaQ123022467MaRDI QIDQ2434742
Publication date: 7 February 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2013.07.006
Related Items (13)
On computing the path number of a graph ⋮ Spanning triangle-trees and flows of graphs ⋮ Gallai's conjecture for graphs with treewidth 3 ⋮ Ádám's conjecture ⋮ Towards Gallai's path decomposition conjecture ⋮ A note on Seymour's second neighborhood conjecture ⋮ Long cycles in Hamiltonian graphs ⋮ The longest cycle problem is polynomial on interval graphs ⋮ Gallai's path decomposition conjecture for triangle-free planar graphs ⋮ Chords in longest cycles ⋮ Long cycles, heavy cycles and cycle decompositions in digraphs ⋮ The conjunction of the linear arboricity conjecture and Lovász's path partition theorem ⋮ Some Conjectures and Questions in Chromatic Topological Graph Theory
This page was built for publication: Beautiful conjectures in graph theory
