scientific article; zbMATH DE number 3536160
From MaRDI portal
Publication:4111622
zbMath0344.05156MaRDI QIDQ4111622
No author found.
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items (21)
Some Ramsey-Type Numbers and the Independence Ratio ⋮ New bounds on the independence number of connected graphs ⋮ Brooks' Theorem and Beyond ⋮ Edge density and independence ratio in triangle-free graphs with maximum degree three ⋮ Finding independent sets in \(K_4\)-free 4-regular connected graphs ⋮ Fractional coloring of triangle-free planar graphs ⋮ Maximum induced forests in graphs of bounded treewidth ⋮ Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs ⋮ On the tightness of the \(\frac {5}{14}\) independence ratio ⋮ Independent sets in the union of two Hamiltonian cycles ⋮ Independence, odd girth, and average degree ⋮ Nordhaus-Gaddum and other bounds for the chromatic edge-stability number ⋮ Independent sets in triangle-free cubic planar graphs ⋮ Brooks' graph-coloring theorem and the independence number ⋮ A short proof of Catlin's extension of Brooks' theorem ⋮ The independence number in graphs of maximum degree three ⋮ Large Independent Sets in Subquartic Planar Graphs ⋮ Bipartite subgraphs of triangle-free subcubic graphs ⋮ Subcubic triangle-free graphs have fractional chromatic number at most 14/5 ⋮ Lower bounds on the independence number in terms of the degrees ⋮ Independence in graphs with maximum degree four
This page was built for publication:
