Nearly bipartite graphs

DOI10.1016/S0012-365X(03)00076-1zbMath1028.05050OpenAlexW2054235532MaRDI QIDQ1412666

Vladimir Nikiforov, Ervin Gyoeri, Richard H. Schelp

Publication date: 25 November 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00076-1

zbMATH Keywords

Minimal degreeNearly bipartite graphsOdd cycle lengths

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (4)

Monochromatic Cycles in 2-Coloured Graphs ⋮ Dense graphs with small clique number ⋮ A new class of Ramsey-Turán problems ⋮ On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs without short odd cycles are nearly bipartite
• Cycles of even length in graphs
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• On Arithmetic Progressions of Cycle Lengths in Graphs
• On maximal paths and circuits of graphs
• ODD Cycles of Specified Length in Non-Bipartite Graphs

This page was built for publication: Nearly bipartite graphs