scientific article; zbMATH DE number 1151823
From MaRDI portal
Publication:4387731
Recommendations
- Size and independence in triangle‐free graphs with maximum degree three
- On the independence number of graphs with maximum degree 3
- On the Independence Number of Graphs with Maximum Degree 3
- The independence number in graphs of maximum degree three
- The Number of Maximal Independent Sets in Triangle-Free Graphs
- The independent domination number of maximal triangle-free graphs
- The number of maximal independent sets in connected triangle-free graphs
- The independence number of circulant triangle-free graphs
- Triangle-free graphs whose independence number equals the degree
- Three bounds on the independence number of a graph
Cited in
(16)- Independence number of 2-factor-plus-triangles graphs
- A note on the independence number of triangle-free graphs. II
- Edge density and independence ratio in triangle-free graphs with maximum degree three
- Independence, odd girth, and average degree
- On the Independence Number of Graphs with Maximum Degree 3
- Independence and matching numbers in triangle free graphs
- scientific article; zbMATH DE number 21730 (Why is no real title available?)
- New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth
- Size and independence in triangle‐free graphs with maximum degree three
- Fractional chromatic number, maximum degree, and girth
- Large independent sets in triangle-free cubic graphs: beyond planarity
- An invariant for minimum triangle-free graphs
- A new proof of the independence ratio of triangle-free cubic graphs
- On the tightness of the \(\frac {5}{14}\) independence ratio
- Triangle-free graphs whose independence number equals the degree
- The independence number in graphs of maximum degree three
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4387731)
