Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits

DOI10.1016/j.disc.2012.04.013zbMath1246.05093OpenAlexW2029837432MaRDI QIDQ442349

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

zbMATH Keywords

sparsitymedial graphsedge-disjoint Hamiltonian pathsrigidity circuits

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Generalized Ramsey theory (05C55) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Density (toughness, etc.) (05C42)

Related Items

Balanced generic circuits without long paths

Cites Work

• Unnamed Item
• Unnamed Item
• Generically globally rigid zeolites in the plane
• Edge-disjoint Hamilton cycles in 4-regular planar graphs
• Pairs of edge-disjoint Hamiltonian circuits
• Advances on the Hamiltonian problem -- a survey
• Connected rigidity matroids and unique realizations of graphs
• Generic global rigidity
• From the theory of regular graphs of third and fourth degree
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Convex Polytopes
• Decomposition of Finite Graphs Into Forests