Contractions, cycle double covers, and cyclic colorings in locally connected graphs
DOI10.1016/J.JCTB.2006.02.009zbMATH Open1107.05052OpenAlexW1979665162MaRDI QIDQ859615FDOQ859615
Authors: Matthias Kriesell 
Publication date: 16 January 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2006.02.009
Recommendations
- Hypergraph coverings and local colorings
- ON α,β CYCLE-CONTRACTIBLE GRAPHS
- Cycle double covers and long circuits of graphs
- Cycle double covers via kotzig graphs
- Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs
- Circle graphs and the cycle double cover conjecture
- Note on cycle double covers of graphs
- Compact cyclic edge-colorings of graphs
- On edge-colored graphs covered by properly colored cycles
- Cycle and cocycle coverings of graphs
Paths and cycles (05C38) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Locally connected graphs
- A new proof of the 6 color theorem
- The four-colour theorem
- Title not available (Why is that?)
- Uncontractable 4-connected graphs
- Polyhedral decompositions of cubic graphs
- Kuratowski's theorem
- Generalizaions of critical connectivity of graphs
- A recursive characterization of the 4-connected graphs
- Cyclic chromatic number of 3-connected plane graphs
- Cyclic coloration of 3-polytopes
- On induced subgraphs of a block
- Title not available (Why is that?)
- In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
- Nonseparating cycles inK-Connected graphs
- On the pancyclicity of lexicographic products
- A survey on contractible edges in graphs of a prescribed vertex connectivity
- How to contract an essentially 6-connected graph to a 5-connected graph
- Contractible triples in 3-connected graphs
- Contractible subgraphs in 3-connected graphs
- On the Four-Colour Conjecture
Cited In (9)
- A survey on the cyclic coloring and its relaxations
- A note on graphs contraction-critical with respect to independence number
- Contraction, k-deficit, and the coloring of hypergraphs
- Note on cycle double covers of graphs
- On the cyclic coloring conjecture
- Lower bounds for locally highly connected graphs
- On the number of 4-contractible edges in 4-connected graphs
- The removable edges and the contractible subgraphs of 5-connected graphs
- How to contract an essentially 6-connected graph to a 5-connected graph
This page was built for publication: Contractions, cycle double covers, and cyclic colorings in locally connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859615)
