On feedback vertex sets and nonseparating independent sets in cubic graphs

Journal of Graph Theory ◽

10.1002/jgt.3190120311 ◽

1988 ◽

Vol 12 (3) ◽

pp. 405-412 ◽

Author(s):

Ewald Speckenmeyer

Keyword(s):

Independent Sets ◽

Cubic Graphs ◽

Download Full-text

A new bound on the feedback vertex sets in cubic graphs

Discrete Mathematics ◽

10.1016/0012-365x(94)00268-n ◽

1996 ◽

Vol 148 (1-3) ◽

pp. 119-131 ◽

Author(s):

Jiping Liu ◽

Cheng Zhao

Keyword(s):

Cubic Graphs ◽

Download Full-text

Counting independent sets in cubic graphs of given girth

Journal of Combinatorial Theory Series B ◽

10.1016/j.jctb.2018.04.009 ◽

2018 ◽

Vol 133 ◽

pp. 211-242 ◽

Author(s):

Guillem Perarnau ◽

Will Perkins

Keyword(s):

Independent Sets ◽

Download Full-text

Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs

Information Processing Letters ◽

10.1016/j.ipl.2011.09.007 ◽

2011 ◽

Vol 111 (23-24) ◽

pp. 1104-1107 ◽

Author(s):

Zuosong Liang ◽

Erfang Shan

Keyword(s):

Approximation Algorithms ◽

Independent Sets ◽

Download Full-text

Symmetric $11$-Venn diagrams with vertex sets $231, 242,...,352$

Studia Scientiarum Mathematicarum Hungarica ◽

10.1556/sscmath.40.2003.1-2.10 ◽

2003 ◽

Vol 40 (1-2) ◽

pp. 121-143

Author(s):

P. Hamburger ◽

A. Sali

Keyword(s):

Venn Diagrams ◽

Download Full-text

Reflexive coloring complexes for 3-edge-colorings of cubic graphs

Discrete Mathematics ◽

10.1016/j.disc.2021.112309 ◽

2021 ◽

Vol 344 (4) ◽

pp. 112309

Author(s):

Fiachra Knox ◽

Bojan Mohar ◽

Nathan Singer

Keyword(s):

Cubic Graphs ◽

Download Full-text

Trees without twin-leaves with smallest number of maximal independent sets

Discrete Mathematics and Applications ◽

10.1515/dma-2020-0006 ◽

2020 ◽

Vol 30 (1) ◽

pp. 53-67 ◽

Author(s):

Dmitriy S. Taletskii ◽

Dmitriy S. Malyshev

Keyword(s):

Independent Sets ◽

Adjacent Vertex ◽

Maximal Independent Sets

AbstractFor any n, in the set of n-vertex trees such that any two leaves have no common adjacent vertex, we describe the trees with the smallest number of maximal independent sets.

Download Full-text

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms

ACM Transactions on Algorithms ◽

10.1145/3379698 ◽

2020 ◽

Vol 16 (3) ◽

pp. 1-31

Author(s):

Daniel Lokshtanov ◽

Fahad Panolan ◽

Saket Saurabh ◽

Roohani Sharma ◽

Meirav Zehavi

Keyword(s):

Independent Sets ◽

Parameterized Algorithms

Download Full-text

Independent sets in n-vertex k-chromatic ℓ-connected graphs

Discrete Mathematics ◽

10.1016/j.disc.2021.112376 ◽

2021 ◽

Vol 344 (7) ◽

pp. 112376

Author(s):

John Engbers ◽

Lauren Keough ◽

Taylor Short

Keyword(s):

Independent Sets ◽

Connected Graphs

Download Full-text

Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth

Random Structures and Algorithms ◽

10.1002/rsa.20994 ◽

2021 ◽

Author(s):

Jiaxi Nie ◽

Jacques Verstraëte

Keyword(s):

Greedy Algorithm ◽

Independent Sets ◽

Uniform Hypergraphs ◽

Download Full-text

Cyclically five-connected cubic graphs

Journal of Combinatorial Theory Series B ◽

10.1016/j.jctb.2017.03.003 ◽

2017 ◽

Vol 125 ◽

pp. 132-167 ◽

Author(s):

Neil Robertson ◽

P.D. Seymour ◽

Robin Thomas

Keyword(s):

Download Full-text