On the connection between chromatic number, maximal clique and minimal degree of a graph

1974/05/01 by B. Andrásfai, P. Erdös, Vera T. Sós +1 · 5 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Chromatic scale #Clique graph #Clique number #Combinatorics #Degree (music) #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Graph power #Line graph #Mathematics #Simplex graph #Vertex (graph theory) #Wheel graph #Windmill graph

paper · doi:10.1016/0012-365x(74)90133-2

crossref issued 1974/05/01 · crossref published 1974/05/01 · crossref published-print 1974/05/01 · openalex publication_date 1974/05/01 · crossref created 2002/07/26 · crossref deposited 2020/02/05 · openalex created_date 2025/10/10 · crossref indexed 2026/08/06 · openalex updated_date 2026/08/06

Citations

• Graphentheoretische Extremalprobleme

Cited by

• On a valence problem in extremal graph theory
• Triangle-free four-chromatic graphs
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• On the Structure of Dense Triangle-Free Graphs
• Independence and graph homomorphisms graph homomorphisms
• The signless Laplacian spectral Turán problems for color-critical graphs
• Triangle-free graph [wikipedia]