A note on independent sets in graphs with large minimum degree and small cliques
From MaRDI portal
Publication:405242
zbMath1300.05232MaRDI QIDQ405242
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i2p38
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07) Density (toughness, etc.) (05C42)
Related Items (6)
Independent domination in subcubic graphs of girth at least six ⋮ Sparse halves in K4‐free graphs ⋮ Independent domination in bipartite cubic graphs ⋮ On independent domination in planar cubic graphs ⋮ Independent domination in subcubic graphs ⋮ An improved upper bound on the independent domination number in cubic graphs of girth at least six
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the structure of triangle-free graphs of large minimum degree
- On a Ramsey-Turán type problem
- On the chromatic number of triangle-free graphs of large minimum degree
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Note on the structure of graphs with bounded clique number
This page was built for publication: A note on independent sets in graphs with large minimum degree and small cliques
