scientific article
From MaRDI portal
Publication:3872499
zbMath0434.05044MaRDI QIDQ3872499
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (38)
A lower bound on the independence number of a graph in terms of degrees and local clique sizes ⋮ A Ramsey‐type problem and the Turán numbers* ⋮ New bounds on the independence number of connected graphs ⋮ On line graphs of subcubic triangle-free graphs ⋮ On three outer-independent domination related parameters in graphs ⋮ Packing and covering triangles in \(K_{4}\)-free planar graphs ⋮ Finding independent sets in \(K_4\)-free 4-regular connected graphs ⋮ Maximum induced forests in graphs of bounded treewidth ⋮ Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs ⋮ A new lower bound on the independence number of a graph and applications ⋮ A note on Reed's conjecture for triangle-free graphs ⋮ The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs ⋮ Independence and matching number of some graphs ⋮ Large minors in graphs with given independence number ⋮ Packing in regular graphs ⋮ Randomly colouring graphs (a combinatorial view) ⋮ A linear hypergraph extension of the bipartite Turán problem ⋮ An improved lower bound on the independence number of a graph ⋮ Computing independent sets in graphs with large girth ⋮ Independence, odd girth, and average degree ⋮ Perfect roman domination in regular graphs ⋮ The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\) ⋮ Independent sets in triangle-free cubic planar graphs ⋮ A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs ⋮ The fractional chromatic number of triangle-free subcubic graphs ⋮ The independence number in graphs of maximum degree three ⋮ Bipartite subgraphs of triangle-free subcubic graphs ⋮ The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3 ⋮ Asymptotics for the Turán number of Berge-\(K_{2,t}\) ⋮ On fractional cut covers ⋮ Ramsey numbers and an approximation algorithm for the vertex cover problem ⋮ On the Independence Number of Graphs with Maximum Degree 3 ⋮ Subcubic triangle-free graphs have fractional chromatic number at most 14/5 ⋮ On the conjecture of Hajos ⋮ Independence in graphs with maximum degree four ⋮ Independence, clique size and maximum degree ⋮ Double outer-independent domination number of graphs ⋮ The maximum clique problem
This page was built for publication:
