The reduction of graph families closed under contraction

DOI10.1016/0012-365X(95)00150-UzbMath0867.05081MaRDI QIDQ1126283

Paul A. Catlin

Publication date: 20 July 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

contractionreductiongraph families

Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Extendability of contractible configurations for nowhere-zero flows and modulo orientations ⋮ Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II ⋮ Double cycle covers and the petersen graph ⋮ Supereulerian graphs: A survey ⋮ Graphs with a 3-cycle-2-cover ⋮ On dense strongly \(\mathbb{Z}_{2 s + 1}\)-connected graphs ⋮ Contractible graphs for flow index less than three ⋮ Mod $(2p+1)$-Orientation on Bipartite Graphs and Complementary Graphs ⋮ On weighted modulo orientation of graphs ⋮ Duality in graph families ⋮ Fractional arboricity, strength, and principal partitions in graphs and matroids ⋮ The spanning connectivity of line graphs ⋮ Flow-contractible configurations and group connectivity of signed graphs ⋮ Hamiltonian connectedness in 3-connected line graphs ⋮ Complete family reduction and spanning connectivity in line graphs

Cites Work

• Unnamed Item
• Disjoint paths in graphs
• 2-linked graphs
• Duality in graph families
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• Decomposition of Finite Graphs Into Forests