Graphs with a cycle of length divisible by three

DOI10.1006/jctb.1994.1019zbMath0799.05036OpenAlexW2067848446MaRDI QIDQ1322021

Akira Saito, Guantao Chen

Publication date: 6 June 1994

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1994.1019

zbMATH Keywords

cycleconnectivity

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (18)

A dichotomy theorem for circular colouring reconfiguration ⋮ Vertex-disjoint subgraphs with high degree sums ⋮ Edge Roman domination on graphs ⋮ Cycle lengths and minimum degree of graphs ⋮ On the existence of vertex-disjoint subgraphs with high degree sum ⋮ Proof of the Kalai-Meshulam conjecture ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ A Strengthening on Odd Cycles in Graphs of Given Chromatic Number ⋮ The extremal function for cycles of length \(\ell\) mod \(k\) ⋮ Cycles of length 2 modulo 3 in graphs ⋮ Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics ⋮ Cycle lengths in expanding graphs ⋮ Cycles of even lengths modulo k ⋮ Homomorphism Reconfiguration via Homotopy ⋮ Upper bounds on Roman domination numbers of graphs ⋮ Unnamed Item ⋮ Cycles of length 0 modulo 4 in graphs ⋮ Cycle lengths modulo \(k\) in expanders

This page was built for publication: Graphs with a cycle of length divisible by three