Balanced generic circuits without long paths
type: Item
instance of: scholarly article
title: Balanced generic circuits without long paths
zbMATH Open document ID: 1245.05073
author: Csaba Király
author: Ferenc Péterfalvi
published in: Discrete Mathematics
publication date: 2012-08-10T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 6064634
zbMATH Keywords: generic circuits
zbMATH Keywords: Hamiltonian path
zbMATH Keywords: count matroid
MaRDI profile type: Publication
full work available at URL: j.disc.2012.03.031
OpenAlex ID: W2047964903
cites work: A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
cites work: Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
cites work: Edge-disjoint Hamilton cycles in 4-regular planar graphs
cites work: Relative lengths of paths and cycles in 3-connected graphs
cites work: Longest Cycles in 3-Connected 3-Regular Graphs
cites work: Compatible circuit decompositions of 4‐regular graphs
cites work: Q4279195
cites work: Shortness exponents of families of graphs
cites work: Pairs of edge-disjoint Hamiltonian circuits
cites work: Longest cycles in 3-connected cubic graphs
cites work: Cycles Intersecting Edge-Cuts of Prescribed Sizes
cites work: Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
cites work: On graphs and rigidity of plane skeletal structures
cites work: Decomposition of Finite Graphs Into Forests
cites work: Shortness parameters of families of regular planar graphs in two or three types of faces
cites work: Q4717849
DOI: 10.1016/J.DISC.2012.03.031
description: scientific article; zbMATH DE number 6064634