Recharacterizing Eulerian: Intimations of new duality
From MaRDI portal
Publication:798673
DOI10.1016/0012-365X(84)90004-9zbMath0547.05043MaRDI QIDQ798673
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)
Related Items
The Hamiltonian index of a graph and its branch-bonds ⋮ Even poset and a parity result for binary linear code ⋮ Cycles containing all the odd-degree vertices ⋮ Elementary proofs of (relatively) recent characterizations of Eulerian graphs ⋮ On the 2-factor index of a graph ⋮ Characterizations of postman sets ⋮ A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs ⋮ A proof of McKee's Eulerian-bipartite characterization ⋮ The structure of even factors in claw-free graphs ⋮ Unnamed Item ⋮ The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs
Cites Work
