Regular \(K_n\)-free graphs

DOI10.1016/0095-8956(83)90071-0zbMath0511.05039OpenAlexW1976904622MaRDI QIDQ1838977

Douglas Bauer

Publication date: 1983

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(83)90071-0

zbMATH Keywords

regular graphscomplete graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (2)

The independence number of circulant triangle-free graphs ⋮ Extremal non-bipartite regular graphs of girth 4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Non-bipartite graphs of girth 4
• Cages—a survey
• Sur les relations symétriques dans l'ensemble fini
• Some Theorems on Abstract Graphs

This page was built for publication: Regular \(K_n\)-free graphs