Semi-regular graphs of minimum independence number

DOI10.1016/S0012-365X(03)00109-2zbMath1030.05059MaRDI QIDQ1420601

D. Massart

Publication date: 2 February 2004

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

zbMATH Keywords

boundsIndependence numberDegree sequenceEstimating lowerFinite simple graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (1)

Havel-Hakimi residues of unigraphs

Cites Work

• Another infinite sequence of dense triangle-free graphs
• Independence and the Havel-Hakimi residue
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• On the residue of a graph
• On the Structure of Dense Triangle-Free Graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness

This page was built for publication: Semi-regular graphs of minimum independence number