A proof of the $\frac{3}{8}$-conjecture for independent domination in cubic graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Brešar, Boštjan, Dravec, Tanja, Henning, Michael A. |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Graphs with unique Grundy dominating sets
by: Brešar, Boštjan, et al.
Published: (2021)
by: Brešar, Boštjan, et al.
Published: (2021)
Best possible upper bounds on the restrained domination number of cubic graphs
by: Brešar, Boštjan, et al.
Published: (2024)
by: Brešar, Boštjan, et al.
Published: (2024)
On Maker-Breaker domination game critical graphs
by: Brešar, Boštjan, et al.
Published: (2025)
by: Brešar, Boštjan, et al.
Published: (2025)
Monophonic number of Kneser graphs and strongly 2-monophonic graphs
by: Brešar, Boštjan, et al.
Published: (2025)
by: Brešar, Boštjan, et al.
Published: (2025)
Induced matching vs edge open packing: trees and product graphs
by: Bresar, Bostjan, et al.
Published: (2024)
by: Bresar, Bostjan, et al.
Published: (2024)
Isolation number: Cartesian and lexicographic products and generalized Sierpiński graphs
by: Bresar, Bostjan, et al.
Published: (2025)
by: Bresar, Bostjan, et al.
Published: (2025)
Distance mutual-visibility coloring: relations with (total) domination, exact distance graphs and graph products
by: Babu, Saneesh, et al.
Published: (2025)
by: Babu, Saneesh, et al.
Published: (2025)
Thresholds for the biased Maker-Breaker domination games
by: Brešar, Boštjan, et al.
Published: (2025)
by: Brešar, Boštjan, et al.
Published: (2025)
Tight bound for independent domination of cubic graphs without $4$-cycles
by: Cho, Eun-Kyung, et al.
Published: (2021)
by: Cho, Eun-Kyung, et al.
Published: (2021)
Injective colorings of Sierpiński-like graphs and Kneser graphs
by: Brešar, Boštjan, et al.
Published: (2024)
by: Brešar, Boštjan, et al.
Published: (2024)
Spreading in claw-free cubic graphs
by: Brešar, Boštjan, et al.
Published: (2024)
by: Brešar, Boštjan, et al.
Published: (2024)
Generalized domination structure in cubic graphs
by: Nakanishi, Misa
Published: (2019)
by: Nakanishi, Misa
Published: (2019)
Paired domination in graphs with minimum degree four
by: Bujtás, Csilla, et al.
Published: (2025)
by: Bujtás, Csilla, et al.
Published: (2025)
Isolation game on graphs
by: Brešar, Boštjan, et al.
Published: (2024)
by: Brešar, Boštjan, et al.
Published: (2024)
On total domination subdivision numbers of trees
by: Henning, Michael A., et al.
Published: (2024)
by: Henning, Michael A., et al.
Published: (2024)
Disjunctive domination in maximal outerplanar graphs
by: Henning, Michael A., et al.
Published: (2025)
by: Henning, Michael A., et al.
Published: (2025)
Characterization of sparse monotone graph classes with bounded domination-to-2-independence ratio
by: Bonamy, Marthe, et al.
Published: (2026)
by: Bonamy, Marthe, et al.
Published: (2026)
Indicated total domination game
by: Henning, Michael A., et al.
Published: (2023)
by: Henning, Michael A., et al.
Published: (2023)
Paired domination in trees: A linear algorithm and asymptotic normality
by: Henning, Michael A., et al.
Published: (2025)
by: Henning, Michael A., et al.
Published: (2025)
Coalition graphs of connected domination partitions in subcubic graphs
by: Dobrynin, Andrey A., et al.
Published: (2025)
by: Dobrynin, Andrey A., et al.
Published: (2025)
Proof of a conjecture on isolation of graphs dominated by a vertex
by: Borg, Peter
Published: (2024)
by: Borg, Peter
Published: (2024)
Independent domination bondage number in graphs
by: Mehraban, M., et al.
Published: (2025)
by: Mehraban, M., et al.
Published: (2025)
Total isolation game in graphs
by: Henning, Michael A., et al.
Published: (2026)
by: Henning, Michael A., et al.
Published: (2026)
Eulerian $k$-dominating reconfiguration graphs
by: Messinger, M. E., et al.
Published: (2024)
by: Messinger, M. E., et al.
Published: (2024)
Counting independent sets in regular graphs with bounded independence number
by: Galvin, David, et al.
Published: (2024)
by: Galvin, David, et al.
Published: (2024)
Stability of $2$-domination number of a graph
by: Mehraban, Mazharuddin, et al.
Published: (2025)
by: Mehraban, Mazharuddin, et al.
Published: (2025)
Claw-free cubic graphs are $(1, 1, 2, 2)$-colorable
by: Brešar, Boštjan, et al.
Published: (2024)
by: Brešar, Boštjan, et al.
Published: (2024)
Well-edge-dominated graphs containing triangles
by: Berg, Jake, et al.
Published: (2024)
by: Berg, Jake, et al.
Published: (2024)
On the independence number in subcubic graphs
by: Harant, Jochen, et al.
Published: (2025)
by: Harant, Jochen, et al.
Published: (2025)
Constructive characterizations concerning total outer-independent domination in subdivision trees
by: Cabrera-Martínez, A., et al.
Published: (2026)
by: Cabrera-Martínez, A., et al.
Published: (2026)
On the domination number of the cartesian product of the path graph and any pair of graphs
by: Tout, Omar
Published: (2023)
by: Tout, Omar
Published: (2023)
Bollobás-Erdős-Tuza conjecture for graphs with no induced $K_{s,t}$
by: Cheng, Xinbu, et al.
Published: (2024)
by: Cheng, Xinbu, et al.
Published: (2024)
Identifying codes in triangle-free graphs of bounded maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)
by: Chakraborty, Dipayan, et al.
Published: (2024)
Exact double domination in subdivision, Mycielskian and middle graphs
by: Behtoei, Ali, et al.
Published: (2024)
by: Behtoei, Ali, et al.
Published: (2024)
An asymptotically tight upper bound for the domination number of the $2$-token graph of path graphs
by: Troncoso, E. Acosta, et al.
Published: (2026)
by: Troncoso, E. Acosta, et al.
Published: (2026)
Lower bounds on the independence number of a graph in terms of degrees
by: Harant, Jochen, et al.
Published: (2025)
by: Harant, Jochen, et al.
Published: (2025)
Grundy double domination number: bounds, graph operations, and efficient computation for $P_4$-tidy graphs
by: Torres, Pablo
Published: (2025)
by: Torres, Pablo
Published: (2025)
Characterization of graphs with orientable total domination number equal to $|V|-1$
by: Blázsik, Zoltán L., et al.
Published: (2024)
by: Blázsik, Zoltán L., et al.
Published: (2024)
Identifying codes in graphs of given maximum degree: Characterizing trees
by: Chakraborty, Dipayan, et al.
Published: (2024)
by: Chakraborty, Dipayan, et al.
Published: (2024)
Domination polynomial and total domination polynomial of zero-divisor graphs of commutative rings
by: Alikhani, Saeid, et al.
Published: (2024)
by: Alikhani, Saeid, et al.
Published: (2024)
Similar Items
-
Graphs with unique Grundy dominating sets
by: Brešar, Boštjan, et al.
Published: (2021) -
Best possible upper bounds on the restrained domination number of cubic graphs
by: Brešar, Boštjan, et al.
Published: (2024) -
On Maker-Breaker domination game critical graphs
by: Brešar, Boštjan, et al.
Published: (2025) -
Monophonic number of Kneser graphs and strongly 2-monophonic graphs
by: Brešar, Boštjan, et al.
Published: (2025) -
Induced matching vs edge open packing: trees and product graphs
by: Bresar, Bostjan, et al.
Published: (2024)