Image de couverture de livre

Induced matching vs edge open packing: trees and product graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bresar, Bostjan, Dravec, Tanja, Hedzet, Jaka, Samadi, Babak
Format:	Preprint
Publié:	2024
Sujets:	Combinatorics 05C05, 05C69, 05C70, 05C76
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Monophonic number of Kneser graphs and strongly 2-monophonic graphs
par: Brešar, Boštjan, et autres
Publié: (2025)

Distance mutual-visibility coloring: relations with (total) domination, exact distance graphs and graph products
par: Babu, Saneesh, et autres
Publié: (2025)

Injective colorings of Sierpiński-like graphs and Kneser graphs
par: Brešar, Boštjan, et autres
Publié: (2024)

Bootstrap percolation in strong products of graphs
par: Brešar, Boštjan, et autres
Publié: (2023)

Graphs with unique Grundy dominating sets
par: Brešar, Boštjan, et autres
Publié: (2021)

Bootstrap percolation and $P_3$-hull number in direct products of graphs
par: Brešar, Boštjan, et autres
Publié: (2024)

Injective coloring of product graphs
par: Samadi, Babak, et autres
Publié: (2023)

On polluted bootstrap percolation in Cartesian grids
par: Brešar, Boštjan, et autres
Publié: (2025)

Edge open packing: complexity, algorithmic aspects, and bounds
par: Brešar, Boštjan, et autres
Publié: (2024)

On Maker-Breaker domination game critical graphs
par: Brešar, Boštjan, et autres
Publié: (2025)

On k-(total) limited packing in graphs
par: Ahmadi, Azam Sadat, et autres
Publié: (2024)

Isolation number: Cartesian and lexicographic products and generalized Sierpiński graphs
par: Bresar, Bostjan, et autres
Publié: (2025)

A proof of the $\frac{3}{8}$-conjecture for independent domination in cubic graphs
par: Brešar, Boštjan, et autres
Publié: (2025)

Injective (edge) colorings of generalized Sierpiński graphs
par: Bhanupriya, C. K., et autres
Publié: (2025)

Spreading in claw-free cubic graphs
par: Brešar, Boštjan, et autres
Publié: (2024)

The minimum number of vertices and edges of connected graphs with ind-match$(G) = p$, min-match$(G) = q$ and match$(G) = r$
par: Matsuda, Kazunori, et autres
Publié: (2025)

Domination and packing in graphs
par: Dúcz, Ákos, et autres
Publié: (2026)

Broadcast independence and packing in certain classes of trees
par: Brewster, Richard C., et autres
Publié: (2024)

Characterizing all nonbipartite well-edge-dominated graphs
par: Anderson, Sarah E., et autres
Publié: (2026)

Characterizing all $K_4$-free well-edge-dominated graphs of girth 3
par: Anderson, Sarah E., et autres
Publié: (2025)

Maximal independent sets in graphs with given matching number
par: Shi, Yongtang, et autres
Publié: (2024)

On the domination number of the cartesian product of the path graph and any pair of graphs
par: Tout, Omar
Publié: (2023)

Domination number of modular product graphs
par: Bermudo, Sergio, et autres
Publié: (2024)

Critical edge sets in vertex-critical graphs
par: Skottova, Ema, et autres
Publié: (2025)

List packing number of bounded degree graphs
par: Cambie, Stijn, et autres
Publié: (2023)

Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
par: Cambie, Stijn, et autres
Publié: (2023)

Independence numbers of the 2-token graphs of some join graphs
par: Rivera, Luis Manuel, et autres
Publié: (2025)

Independence numbers of some double vertex graphs and pair graphs
par: Jiménez-Sepúlveda, Paloma, et autres
Publié: (2018)

An asymptotically tight upper bound for the domination number of the $2$-token graph of path graphs
par: Troncoso, E. Acosta, et autres
Publié: (2026)

Grundy double domination number: bounds, graph operations, and efficient computation for $P_4$-tidy graphs
par: Torres, Pablo
Publié: (2025)

Refinement of a conjecture on positive square energy of graphs
par: Akbari, Saieed, et autres
Publié: (2025)

Exact double domination in subdivision, Mycielskian and middle graphs
par: Behtoei, Ali, et autres
Publié: (2024)

The odd independence number of graphs, I: Foundations and classical classes
par: Caro, Yair, et autres
Publié: (2025)

Saved by the rook: a case of matchings and Hamiltonian cycles
par: Abreu, Marién, et autres
Publié: (2021)

Isolation game on graphs
par: Brešar, Boštjan, et autres
Publié: (2024)

Moving through Cartesian products, coronas and joins in general position
par: Klavžar, Sandi, et autres
Publié: (2025)

$k$-fault-tolerant graphs for $p$ disjoint complete graphs of order $c$
par: Cichacz, Sylwia, et autres
Publié: (2022)

The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
par: Caro, Yair, et autres
Publié: (2025)

On the number of triangles in $K_4$-free graphs
par: He, Jialin, et autres
Publié: (2025)

The Pairing-Hamiltonian property in graph prisms
par: Abreu, Marién, et autres
Publié: (2023)