Subgraph coverings and edge switchings

DOI10.1006/jctb.2001.2063zbMath1031.05104OpenAlexW2075800592MaRDI QIDQ1850576

Geng-Hua Fan

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2001.2063

zbMATH Keywords

path coveringscircuit coverings

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (16)

Dicycle cover of Hamiltonian oriented graphs ⋮ An overview of graph covering and partitioning ⋮ Small cycle covers of 3-connected cubic graphs ⋮ Maximizing the number of independent sets of fixed size in Kn‐covered graphs ⋮ The Number of Cliques in Graphs Covered by Long Cycles ⋮ Small cycle cover of 2-connected cubic graphs ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Covers of Eulerian graphs ⋮ A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture ⋮ The codiameter of a 2-connected graph ⋮ Graphs with almost all edges in long cycles ⋮ Path decompositions and Gallai's conjecture ⋮ Cycles in 2-connected graphs ⋮ How many circuits determine an oriented matroid? ⋮ Path and cycle decompositions of dense graphs ⋮ Cycle packing

Cites Work

• An Erdős-Gallai conjecture
• On the coverings of graphs
• Covering the edges of a connected graph by paths
• An upper bound for the path number of a graph
• The Representation of a Graph by Set Intersections
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Subgraph coverings and edge switchings