Subgraph coverings and edge switchings

DOI10.1006/JCTB.2001.2063zbMATH Open1031.05104OpenAlexW2075800592MaRDI QIDQ1850576FDOQ1850576

Authors: Genghua 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

Recommendations

• Covering the edges of a connected graph by paths
• Proofs of two minimum circuit cover conjectures
• An Erdős-Gallai conjecture
• Covers of Eulerian graphs
• scientific article; zbMATH DE number 871189

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)

Cites Work

• Graph theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Covering the edges of a connected graph by paths
• An upper bound for the path number of a graph
• On the coverings of graphs
• The Representation of a Graph by Set Intersections
• An Erdős-Gallai conjecture

Cited In (21)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850576)