Cycles of length 2 modulo 3 in graphs
From MaRDI portal
One theorem is shown: If a graph \(G\) with minimum degree \((\delta)\) at least 3 has no cycle of length \(2\pmod 3\), then \(G\) contains either an induced \(K_ 4\) or \(K_{3,3}\). A consequence is an earlier result by Dean et al. that a 2-connected graph \(G\) with \(\delta(G)\geq 3\) has a cycle of length \(2\pmod 3\) unless \(G\) is a \(K_ 4\) or \(K_{3,n}(n\geq 3)\).
Recommendations
- Cycles of length 1 modulo 3 in graph
- scientific article; zbMATH DE number 867680
- Cycles of length 0 modulo 4 in graphs
- Graphs with a cycle of length divisible by three
- Cycle lengths modulo \(k\) in large 3-connected cubic graphs
- Cycles in 2-connected graphs
- On cycles in 3-connected graphs
- On cycle lengths in graphs of moderate degree
- scientific article; zbMATH DE number 617590
- On 2-cycles of graphs
Cites work
Cited in
(13)- Graphs with a cycle of length divisible by three
- Cycles in color-critical graphs
- 1 4-cycles
- scientific article; zbMATH DE number 617590 (Why is no real title available?)
- scientific article; zbMATH DE number 1472141 (Why is no real title available?)
- A strengthening on odd cycles in graphs of given chromatic number
- Cycle lengths modulo \(k\) in large 3-connected cubic graphs
- scientific article; zbMATH DE number 2230314 (Why is no real title available?)
- Cycles of length 1 modulo 3 in graph
- 4-Chromatic graphs have at least four cycles of length 0 mod 3
- On graphs without cycles of length 0 modulo 4
- Maximum number of cliques in \(\{C_{k_1}, C_{k_2}, C_{k_3}, \cdots \}\)-free graphs with \(6 = k_1 < k_2 < \cdots\) and \(k_{i+1} - k_i \leq 5\)
- Cycle lengths in graphs of given minimum degree
This page was built for publication: Cycles of length 2 modulo 3 in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197035)
