Publication:4111622
From MaRDI portal
zbMath0344.05156MaRDI QIDQ4111622
No author found.
Publication date: 1976
05C35: Extremal problems in graph theory
05C15: Coloring of graphs and hypergraphs
05C99: Graph theory
Related Items
Subcubic triangle-free graphs have fractional chromatic number at most 14/5, Maximum induced forests in graphs of bounded treewidth, Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs, Independence in graphs with maximum degree four, Fractional coloring of triangle-free planar graphs, On the tightness of the \(\frac {5}{14}\) independence ratio, The independence number in graphs of maximum degree three, Brooks' graph-coloring theorem and the independence number, A short proof of Catlin's extension of Brooks' theorem, Finding independent sets in \(K_4\)-free 4-regular connected graphs, Lower bounds on the independence number in terms of the degrees, Edge density and independence ratio in triangle-free graphs with maximum degree three, Independent sets in triangle-free cubic planar graphs, Bipartite subgraphs of triangle-free subcubic graphs, Large Independent Sets in Subquartic Planar Graphs, Independence, odd girth, and average degree, Brooks' Theorem and Beyond, Some Ramsey-Type Numbers and the Independence Ratio