Size, chromatic number, and connectivity

DOI10.1007/BF02986667zbMath0817.05026OpenAlexW1968076455MaRDI QIDQ1340118

Tariq Samad, Douglas B. West, Jayaram Bhasker

Publication date: 6 August 1995

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02986667

zbMATH Keywords

sizeconnectivitychromatic number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (1)

Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs

Cites Work

• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
• The number of edges in critical graphs.
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• The structure of k-chromatic graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Size, chromatic number, and connectivity