On covers of graphs
From MaRDI portal
Publication:1422433
DOI10.1016/S0012-365X(03)00314-5zbMATH Open1031.05109MaRDI QIDQ1422433FDOQ1422433
Authors: Jana Maxová, J. Nešetřil 
Publication date: 14 February 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Aspects of structural combinatorics. (Graph homomorphisms and their use)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs with the Circuit Cover Property
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- Decomposition of the complete directed graph into k-circuits
- Title not available (Why is that?)
- Perfect path double covers of graphs
- Perfect path double covers in every simple graph
- What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?
- On oriented path double covers
Cited In (31)
- The Kuratowski covering conjecture for graphs of order < 10 for the nonorientable surfaces of genus 3 and 4
- On some covering graphs of a graph
- Orientable one-circuit double covers
- On covers of graphs by Cayley graphs
- Covering graphs: The covering problem solved
- On cover-structure graphs
- On oriented path double covers
- On the oriented perfect path double cover conjecture
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partial and perfect path covers of cographs
- Reorientations of covering graphs
- Some computational aspects of solvable regular covers of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Near perfect coverings in graphs and hypergraphs
- Covering arrays on graphs
- Title not available (Why is that?)
- Covers of complete graphs and related association schemes
- Title not available (Why is that?)
- The covering chain of a graph
- Title not available (Why is that?)
- A common cover of graphs and 2-cell embeddings
- A note on the cover degeneracy of graphs
- Title not available (Why is that?)
- Small oriented cycle double cover of graphs
- On covers of graphs
- Three ways to cover a graph
- Covering projections of graphs preserving links of vertices and edges
- Title not available (Why is that?)
- Ω-Covers of Graphs
This page was built for publication: On covers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422433)
