Imagen de Portada

Secure domination in $P_5$-free graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gupta, Uttam K., Henning, Michael A., Maniya, Paras Vinubhai, Pradhan, Dinabandhu
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Disjunctive domination in maximal outerplanar graphs
por: Henning, Michael A., et al.
Publicado: (2025)

$4K_1$-free graph with the cop number $3$
por: Char, Arnab, et al.
Publicado: (2025)

Locating-dominating partitions for some classes of graphs
por: Foucaud, Florent, et al.
Publicado: (2025)

Perfect divisibility of some bull-free graphs and its application
por: Chen, Ran, et al.
Publicado: (2026)

The 1/3-conjectures for domination in cubic graphs
por: Dorbec, Paul, et al.
Publicado: (2024)

On open-separating dominating codes in graphs
por: Chakraborty, Dipayan, et al.
Publicado: (2024)

Progress towards the two-thirds conjecture on locating-total dominating sets
por: Chakraborty, Dipayan, et al.
Publicado: (2022)

Tree-independence number of $P_5$-free graphs with no large bicliques
por: Blažej, Václav, et al.
Publicado: (2026)

On three domination-based identification problems in block graphs
por: Chakraborty, Dipayan, et al.
Publicado: (2018)

An optimal chromatic bound for ($P_2+P_3$, gem)-free graphs
por: Char, Arnab, et al.
Publicado: (2024)

On graph classes with constant domination-packing ratio
por: Bonamy, Marthe, et al.
Publicado: (2025)

Vertex-edge domination on subclasses of bipartite graphs
por: Pandey, Arti, et al.
Publicado: (2025)

($P_2+P_4$, $K_4-e$)-free graphs are nearly $ω$-colorable
por: Angeliya, C. U., et al.
Publicado: (2025)

Powers of large matrices on GPU platforms to compute the Roman domination number of cylindrical graphs
por: Martínez, J. A., et al.
Publicado: (2024)

HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs
por: Garzón, E. M., et al.
Publicado: (2024)

Vertex-critical graphs in co-gem-free graphs
por: Beaton, Iain, et al.
Publicado: (2024)

Cops and robbers on $P_5$-free graphs
por: Chudnovsky, Maria, et al.
Publicado: (2023)

Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
por: Das, Sandip, et al.
Publicado: (2023)

On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
por: Adekanye, Melvin, et al.
Publicado: (2024)

$θ$-free matching covered graphs
por: Joshi, Rohinee, et al.
Publicado: (2024)

Coloring bridge-free antiprismatic graphs
por: Robin, Cléophée, et al.
Publicado: (2024)

Hitting all longest paths in $H$-free graphs and $H$-graphs
por: de Lima, Paloma T., et al.
Publicado: (2025)

The sandwich problem for odd-hole-free and even-hole-free graphs
por: Cameron, Kathie, et al.
Publicado: (2024)

Non-empty intersection of longest paths in $H$-free graphs
por: Long Jr., James A., et al.
Publicado: (2023)

Nucleation-free independent graphs with implied nonedges
por: Cheng, Jialong, et al.
Publicado: (2025)

Independent sets and colorings of $K_{t,t,t}$-free graphs
por: Dhawan, Abhishek, et al.
Publicado: (2025)

Proper conflict-free choosability of planar graphs
por: Wang, Yuting, et al.
Publicado: (2025)

Computing fixed point free automorphisms of graphs
por: Abiad, Aida, et al.
Publicado: (2026)

The strong chromatic index of $K_{t,t}$-free graphs
por: Bi, Richard, et al.
Publicado: (2026)

Path eccentricity of $k$-AT-free graphs and application on graphs with the consecutive ones property
por: Bastide, Paul, et al.
Publicado: (2024)

Computational and Combinatorial Results on Conflict-free Choosability
por: Gupta, Shiwali, et al.
Publicado: (2026)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
por: Pilipczuk, Marcin, et al.
Publicado: (2023)

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
por: Chakraborty, Dibyayan
Publicado: (2025)

Roman domination in weighted graphs
por: Cera, Martín, et al.
Publicado: (2025)

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
por: Choi, Mujin, et al.
Publicado: (2025)

Optimal local identifying and local locating-dominating codes
por: Herva, Pyry, et al.
Publicado: (2023)

Improved lower bounds on the maximum size of graphs with girth 5
por: Goedgebeur, Jan, et al.
Publicado: (2025)

Extremal digraphs for open neighbourhood location-domination and identifying codes
por: Foucaud, Florent, et al.
Publicado: (2023)

On locating and neighbor-locating colorings of sparse graphs
por: Chakraborty, Dipayan, et al.
Publicado: (2023)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
por: Beaudou, Laurent, et al.
Publicado: (2025)