Cycles of length 0 modulo 4 in graphs

DOI10.1016/0012-365X(93)90535-2zbMath0791.05064OpenAlexW2005748221MaRDI QIDQ1309447

Linda Lesniak, Akira Saito, Nathaniel Dean

Publication date: 8 June 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90535-2

zbMATH Keywords

cyclechromatic graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

A dichotomy theorem for circular colouring reconfiguration ⋮ Optimal colorings with rainbow paths ⋮ Cycle lengths and minimum degree of graphs ⋮ Cycles with consecutive odd lengths ⋮ Split Euler tours in 4-regular planar graphs ⋮ Coloring digraphs with forbidden cycles ⋮ The extremal function for cycles of length \(\ell\) mod \(k\) ⋮ Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics ⋮ Cycle lengths in expanding graphs ⋮ Cycles of even lengths modulo k ⋮ Unnamed Item ⋮ Cycle lengths modulo \(k\) in expanders

Cites Work

• A strengthening of the Kuratowski planarity criterion for 3-connected graphs
• A refinement of Kuratowski's theorem
• Graphs with a cycle of length divisible by three
• Large cycles in graphs
• Some Homeomorphism Properties of Graphs
• Graph decomposition with applications to subdivisions and path systems modulo k
• Cyclic coloration of 3-polytopes
• Cycles Modulo k
• Modularity of cycles and paths in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cycles of length 0 modulo 4 in graphs