Graphs of odd girth 7 with large degree

DOI10.1016/j.endm.2009.07.015zbMath1272.05083OpenAlexW2020607239MaRDI QIDQ2851445

Elizabeth Ribe-Baumann, Stephan Brandt

Publication date: 10 October 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.015

zbMATH Keywords

minimum degreeextremal graph theoryodd girth

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (1)

Graphs of odd girth 7 with large degree

Cites Work

• Unnamed Item
• Graphs whose every independent set has a common neighbour
• Graphs with odd girth at least seven and high minimum degree
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• On a valence problem in extremal graph theory
• Graphs of odd girth 7 with large degree
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• Independence and graph homomorphisms graph homomorphisms
• Triangle-Free Graphs with High Minimal Degrees
• Graphentheoretische Extremalprobleme

This page was built for publication: Graphs of odd girth 7 with large degree