Cover Image

The vertex visibility number of graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Roy, Dhanya, Di Stefano, Gabriele, Klavžar, Sandi, S, Aparna Lakshmanan
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Mutual-visibility problems on graphs of diameter two
by: Cicerone, Serafino, et al.
Published: (2024)

Mutual-visibility and general position in double graphs and in Mycielskians
by: Roy, Dhanya, et al.
Published: (2024)

Fault-tolerant mutual-visibility: complexity and solutions for grid-like networks
by: Cicerone, Serafino, et al.
Published: (2025)

Counting largest mutual-visibility and general position sets of glued $t$-ary trees
by: Roy, Dhanya, et al.
Published: (2024)

Varieties of mutual-visibility and general position on Sierpiński graphs
by: Roy, Dhanya, et al.
Published: (2025)

Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)

A new vertex coloring heuristic and corresponding chromatic number
by: Zaker, Manouchehr
Published: (2020)

EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)

Cop numbers of periodic graphs
by: De Carufel, Jean-Lou, et al.
Published: (2023)

On the inversion number of oriented graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2021)

Dichromatic number of chordal graphs
by: Bessy, Stéphane, et al.
Published: (2023)

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

Acyclic dichromatic number of oriented graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2025)

Preparing graph states forbidding a vertex-minor
by: Davies, James, et al.
Published: (2025)

The vertex-pancyclicity of the simplified shuffle-cube and the vertex-bipancyclicity of the balanced shuffle-cube
by: Liu, Yasong, et al.
Published: (2024)

On cuts of small chromatic number in sparse graphs
by: Aubian, Guillaume, et al.
Published: (2025)

The Frank number and nowhere-zero flows on graphs
by: Goedgebeur, Jan, et al.
Published: (2023)

Biclique immersions in graphs with independence number 2
by: Botler, Fábio, et al.
Published: (2023)

More results on the $z$-chromatic number of graphs
by: Khaleghi, Abbas, et al.
Published: (2023)

A polynomial kernel for vertex deletion into bipartite permutation graphs
by: Derbisz, Jan
Published: (2021)

Representation number of word-representable co-bipartite graph
by: Das, Biswajit, et al.
Published: (2025)

Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Winding number and circular 4-coloring of signed graphs
by: Gujgiczer, Anna, et al.
Published: (2023)

Three-dimensional graph products with unbounded stack-number
by: Eppstein, David, et al.
Published: (2022)

On the minimum number of arcs in $4$-dicritical oriented graphs
by: Havet, Frédéric, et al.
Published: (2023)

The one-visibility Localization game
by: Bonato, Anthony, et al.
Published: (2023)

Exact rainbow numbers of cycle-related graphs in multi-hubbed wheels
by: Dai, Mengyao, et al.
Published: (2025)

Centered colorings and weak coloring numbers in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2026)

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

On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
by: Das, Sandip, et al.
Published: (2023)

The tripartite-circle crossing number of graphs with two small partition classes
by: Camacho, Charles, et al.
Published: (2021)

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

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)

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

Counting the minimum number of arcs in an oriented graph having weak diameter 2
by: Das, Sandip, et al.
Published: (2023)

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

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)

Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)