Recharacterizing Eulerian: Intimations of new duality
From MaRDI portal
Publication:798673
DOI10.1016/0012-365X(84)90004-9zbMATH Open0547.05043MaRDI QIDQ798673FDOQ798673
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Eulerian and Hamiltonian graphs (05C45) Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75)
Cites Work
Cited In (13)
- The Hamiltonian index of a graph and its branch-bonds
- On the 2-factor index of a graph
- Even poset and a parity result for binary linear code
- New characterizations of Eulerian and bipartite binary matroids
- Elementary proofs of (relatively) recent characterizations of Eulerian graphs
- The structure of even factors in claw-free graphs
- A proof of McKee's Eulerian-bipartite characterization
- Title not available (Why is that?)
- Cycles containing all the odd-degree vertices
- The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs
- Title not available (Why is that?)
- Characterizations of postman sets
- A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs
Recommendations
- Title not available (Why is that?) 👍 👎
- The Euler line revisited 👍 👎
- Dualization of the Euler and Hamiltonian inclusions 👍 👎
- The Newton complementary dual revisited 👍 👎
- On Euler-Lagrange’s Equations: A New Approach 👍 👎
- A note on reparametrizations of the Euler equations 👍 👎
- Title not available (Why is that?) 👍 👎
- Euler Diagrams Through the Looking Glass: From Extent to Intent 👍 👎
- The structure of the Euler-Lagrange mapping 👍 👎
This page was built for publication: Recharacterizing Eulerian: Intimations of new duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798673)
