Pages that link to "Item:Q2490253"
From MaRDI portal
The following pages link to Independent sets in triangle-free cubic planar graphs (Q2490253):
Displaying 32 items.
- On bipartization of cubic graphs by removal of an independent set (Q298966) (← links)
- Maximum induced forests in graphs of bounded treewidth (Q396918) (← links)
- Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs (Q400359) (← links)
- Independent sets in graphs (Q501998) (← links)
- Leapfrog fullerenes have many perfect matchings (Q937674) (← links)
- Volume estimates for equiangular hyperbolic Coxeter polyhedra (Q1022516) (← links)
- Triangle-free planar graphs with small independence number (Q1633607) (← links)
- Bounded-degree independent sets in planar graphs (Q1780842) (← links)
- Counting independent sets in cubic graphs of given girth (Q1791708) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- Disjoint triangles of a cubic line graph (Q1889836) (← links)
- Independent sets in \((P_4+P_4\),triangle)-free graphs (Q2053685) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- On independent domination in planar cubic graphs (Q2312063) (← links)
- Transversals and independence in linear hypergraphs with maximum degree two (Q2363113) (← links)
- On line graphs of subcubic triangle-free graphs (Q2400553) (← links)
- On \(k\)-domination and \(j\)-independence in graphs (Q2446328) (← links)
- Maximizing the number of independent sets in claw-free cubic graphs (Q2698077) (← links)
- Large Independent Sets in Subquartic Planar Graphs (Q2803824) (← links)
- The Fano plane and the strong independence ratio in hypergraphs of maximum degree 3 (Q2825489) (← links)
- Multiple Domination (Q3384609) (← links)
- The maximum independent set problem for cubic planar graphs (Q3834072) (← links)
- (Q3972023) (← links)
- Finding Independent Sets in Triangle-Free Graphs (Q4717575) (← links)
- Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three (Q4908832) (← links)
- Large Independent Sets in Triangle-Free Planar Graphs (Q5270410) (← links)
- Subcubic triangle-free graphs have fractional chromatic number at most 14/5 (Q5494396) (← links)
- Packing and covering odd cycles in cubic plane graphs with small faces (Q5915831) (← links)
- Packing and covering odd cycles in cubic plane graphs with small faces (Q5920132) (← links)
- A new proof of the independence ratio of triangle-free cubic graphs (Q5936033) (← links)
- Relating the independence number and the dissociation number (Q6094030) (← links)
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number (Q6615757) (← links)
