Balanced generic circuits without long paths

DOI10.1016/j.disc.2012.03.031zbMath1245.05073OpenAlexW2047964903MaRDI QIDQ442309

Ferenc Péterfalvi, Csaba Király

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.03.031

zbMATH Keywords

Hamiltonian pathcount matroidgeneric circuits

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (1)

Four-regular graphs with extremal rigidity properties

Cites Work

• Unnamed Item
• Unnamed Item
• Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
• Longest cycles in 3-connected cubic graphs
• Relative lengths of paths and cycles in 3-connected graphs
• Edge-disjoint Hamilton cycles in 4-regular planar graphs
• Shortness parameters of families of regular planar graphs in two or three types of faces
• Pairs of edge-disjoint Hamiltonian circuits
• A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
• On graphs and rigidity of plane skeletal structures
• Shortness exponents of families of graphs
• Cycles Intersecting Edge-Cuts of Prescribed Sizes
• Longest Cycles in 3-Connected 3-Regular Graphs
• Compatible circuit decompositions of 4‐regular graphs
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Balanced generic circuits without long paths