Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
DOI10.1016/J.DISC.2012.04.013zbMATH Open1246.05093OpenAlexW2029837432MaRDI QIDQ442349FDOQ442349
Authors: Shuji Kijima, Shin-Ichi Tanigawa 
Publication date: 10 August 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.04.013
Recommendations
- On characterizations of rigid graphs in the plane using spanning trees
- Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
- Balanced generic circuits without long paths
- A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid
- Packing of rigid spanning subgraphs and spanning trees
Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40) Density (toughness, etc.) (05C42) Generalized Ramsey theory (05C55)
Cites Work
- Connected rigidity matroids and unique realizations of graphs
- Generic global rigidity
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Decomposition of Finite Graphs Into Forests
- Title not available (Why is that?)
- From the theory of regular graphs of third and fourth degree
- Convex Polytopes
- Advances on the Hamiltonian problem -- a survey
- Generically globally rigid zeolites in the plane
- Edge-disjoint Hamilton cycles in 4-regular planar graphs
- Pairs of edge-disjoint Hamiltonian circuits
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442349)
