Duality in graph families

DOI10.1016/0012-365X(92)90705-KzbMath0772.05084MaRDI QIDQ1208357

Hong-Jian Lai, Hongyuan Lai

Publication date: 16 May 1993

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

zbMATH Keywords

contractiondualitygraph familiescomplete graph familyfree families

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (8)

Extendability of contractible configurations for nowhere-zero flows and modulo orientations ⋮ The reduction of graph families closed under contraction ⋮ \(Z_3\)-connectivity in abelian Cayley graphs ⋮ On weighted modulo orientation of graphs ⋮ Group connectivity and group colorings of graphs --- a survey ⋮ Flows and parity subgraphs of graphs with large odd-edge-connectivity ⋮ Complete family reduction and spanning connectivity in line graphs ⋮ Ons-Hamiltonian Line Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Hamiltonian index
• Contractions of graphs with no spanning Eulerian subgraphs
• Spanning Eulerian subgraphs and matchings
• The reduction of graph families closed under contraction
• Graph whose edges are in small cycles
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Double cycle covers and the petersen graph
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Contractions and hamiltonian line graphs
• A reduction method to find spanning Eulerian subgraphs
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Duality in graph families