Contractions, cycle double covers, and cyclic colorings in locally connected graphs

DOI10.1016/j.jctb.2006.02.009zbMath1107.05052OpenAlexW1979665162MaRDI QIDQ859615

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

zbMATH Keywords

local connectivitypancyclicitylexicographic productcyclic chromatic number

Mathematics Subject Classification ID

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

Related Items (8)

Lower bounds for locally highly connected graphs ⋮ How to contract an essentially 6-connected graph to a 5-connected graph ⋮ On the cyclic coloring conjecture ⋮ A survey on the cyclic coloring and its relaxations ⋮ A note on graphs contraction-critical with respect to independence number ⋮ The removable edges and the contractible subgraphs of 5-connected graphs ⋮ On the number of 4-contractible edges in 4-connected graphs ⋮ Note on cycle double covers of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to contract an essentially 6-connected graph to a 5-connected graph
• Generalizaions of critical connectivity of graphs
• In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
• Contractible triples in 3-connected graphs
• A survey on contractible edges in graphs of a prescribed vertex connectivity
• The four-colour theorem
• Contractible subgraphs in 3-connected graphs
• A recursive characterization of the 4-connected graphs
• On the pancyclicity of lexicographic products
• Cyclic Chromatic Number of 3-Connected Plane Graphs
• Cyclic coloration of 3-polytopes
• On the Four-Colour Conjecture
• Kuratowski's theorem
• Nonseparating cycles inK-Connected graphs
• Uncontractable 4-connected graphs
• On induced subgraphs of a block
• Locally connected graphs
• A new proof of the 6 color theorem
• Polyhedral decompositions of cubic graphs

This page was built for publication: Contractions, cycle double covers, and cyclic colorings in locally connected graphs