Size and independence in triangle‐free graphs with maximum degree three
From MaRDI portal
Publication:4712120
DOI10.1002/jgt.3190140503zbMath0739.05046OpenAlexW2036014900MaRDI QIDQ4712120
Publication date: 25 June 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140503
Related Items (17)
Transversals and independence in linear hypergraphs with maximum degree two ⋮ The largest transversal numbers of uniform hypergraphs ⋮ Finding independent sets in \(K_4\)-free 4-regular connected graphs ⋮ Maximum induced forests in graphs of bounded treewidth ⋮ Lower bounds on the independence number of certain graphs of odd girth at least seven ⋮ Randomly colouring graphs (a combinatorial view) ⋮ On the tightness of the \(\frac {5}{14}\) independence ratio ⋮ Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three ⋮ Independent sets in triangle-free cubic planar 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 ⋮ Zero forcing in claw-free cubic graphs ⋮ The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3 ⋮ On the Independence Number of Graphs with Maximum Degree 3 ⋮ Subcubic triangle-free graphs have fractional chromatic number at most 14/5 ⋮ Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees
This page was built for publication: Size and independence in triangle‐free graphs with maximum degree three
