On constructive characterizations of \((k,l)\)-sparse graphs

DOI10.1016/J.EJC.2006.06.016zbMath1182.05099OpenAlexW4206028072MaRDI QIDQ852713

László Szegő

Publication date: 15 November 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2006.06.016

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (2)

Infinitesimal rigidity for non-Euclidean bar-joint frameworks ⋮ Sparse hypergraphs and pebble game algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
• Linking \((n-2)\)-dimensional panels in \(n\)-space. I: \((k-1,k)\)-graphs and \((k-1,k)\)-frames
• A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
• Constructive characterizations for packing and covering with trees
• Graph orientations with edge-connection and parity constraints
• On graphs and rigidity of plane skeletal structures
• The Union of Matroids and the Rigidity of Frameworks
• Decomposition of Finite Graphs Into Forests

This page was built for publication: On constructive characterizations of \((k,l)\)-sparse graphs