Extremal non-bipartite regular graphs of girth 4

DOI10.1016/0095-8956(84)90045-5zbMath0528.05038OpenAlexW2047745130MaRDI QIDQ5896181

Douglas Bauer

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90045-5

zbMATH Keywords

regular graphsgirth

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (3)

Regular Turán numbers and some Gan–Loh–Sudakov‐type problems ⋮ Extremal non-bipartite regular graphs of girth 4 ⋮ Extremal non-bipartite regular graphs of girth 4

Cites Work

• Regular \(K_n\)-free graphs
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Non-bipartite graphs of girth 4
• Regular graphs with given girth pair
• Cages—a survey
• Extremal non-bipartite regular graphs of girth 4
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal non-bipartite regular graphs of girth 4