scientific article; zbMATH DE number 1117463
From MaRDI portal
Publication:4376500
The authors prove the following results: (1) With the exception of the complete graphs on one and two vertices, every simple graph having at most two vertices of degree less than three contains two cycles whose lengths differ by one or two. (2) Every non-bipartite 3-connected graph has two cycles whose lengths differ by one. They also conjecture that for any natural number \(k\) there are at most finitely many simple graphs having at most \(k\) vertices of degree less than three but no two cycles whose lengths differ by one or two.
Recommendations
Cited in
(20)- A generalization of Fan's results: Distribution of cycle lengths in graphs
- Cycle lengths and minimum degree of graphs
- Cycles of given lengths in hypergraphs
- Distribution of cycle lengths in graphs
- On a conjecture of Bondy and Vince
- On the existence of a cycle of length at least 7 in a (1, 2)-twin-free graph
- Coloring graphs with two odd cycle lengths
- The extremal function for cycles of length \(\ell\) mod \(k\)
- 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 6471182 (Why is no real title available?)
- scientific article; zbMATH DE number 2230942 (Why is no real title available?)
- Linear cycles of consecutive lengths
- Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two
- A note on two cycles of consecutive even lengths in graphs
- A strengthening on consecutive odd cycles in graphs of given minimum degree
- Balanced subdivisions and cycles lengths in \(K_{s, t}\)-free graphs
- Cycle lengths in graphs of given minimum degree
- Cycles with consecutive odd lengths
- Linked graphs with restricted lengths
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376500)
