Supereulerian graphs and the Petersen graph
From MaRDI portal
Publication:5917747
DOI10.1006/jctb.1996.0009zbMath0839.05070OpenAlexW2053749941MaRDI QIDQ5917747
Publication date: 18 June 1996
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/39cd2f4696bcc1019e218fb7724d1fa263fee9f7
Related Items (8)
Spanning trails with variations of Chvátal-Erdős conditions ⋮ Snarks, hypohamiltonian graphs and non-supereulerian graphs ⋮ Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds ⋮ On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\) ⋮ Supereulerian graphs and the Petersen graph ⋮ Spanning trails in essentially 4-edge-connected graphs ⋮ Generalized cospectral graphs with and without Hamiltonian cycles ⋮ Catlin’s reduced graphs with small orders
This page was built for publication: Supereulerian graphs and the Petersen graph