ODD Cycles of Specified Length in Non-Bipartite Graphs
From MaRDI portal
Publication:3953799
DOI10.1016/S0304-0208(08)73552-7zbMath0492.05047MaRDI QIDQ3953799
Publication date: 1982
Published in: Graph Theory, Proceedings of the Conference on Graph Theory (Search for Journal in Brave)
Related Items (26)
The chromatic profile of locally colourable graphs ⋮ Dense graphs with small clique number ⋮ An extremal problem for cycles in hamiltonian graphs ⋮ Triangle-free four-chromatic graphs ⋮ On the local density problem for graphs of given odd-girth ⋮ Cycle lengths and minimum degree of graphs ⋮ The chromatic profile of locally bipartite graphs ⋮ Andrásfai and Vega graphs in Ramsey–Turán theory ⋮ Regular Turán numbers and some Gan–Loh–Sudakov‐type problems ⋮ The critical number of dense triangle-free binary matroids ⋮ The minimum degree removal lemma thresholds ⋮ Nearly bipartite graphs ⋮ Critical graphs without triangles: an optimum density construction ⋮ Semi-regular graphs of minimum independence number ⋮ Cycle-maximal triangle-free graphs ⋮ On the KŁR conjecture in random graphs ⋮ On the chromatic number of \(H\)-free graphs of large minimum degree ⋮ Sparse halves in dense triangle-free graphs ⋮ Triangle-free graphs whose independence number equals the degree ⋮ On the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphs ⋮ On the structure of Dense graphs with bounded clique number ⋮ Homomorphism thresholds for odd cycles ⋮ Graphs of odd girth 7 with large degree ⋮ Hamiltonian pancyclic graphs ⋮ Odd wheels in graphs ⋮ Pancyclism in hamiltonian graphs
This page was built for publication: ODD Cycles of Specified Length in Non-Bipartite Graphs
