Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]
Fuente:
arXiv
Saved in:
| Main Authors: | Dourado, Mitre C., Ponciano, Vitor S., da Silva, Rômulo L. O. |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Expanded-clique graphs and the domination problem
by: Dourado, Mitre C., et al.
Published: (2022)
by: Dourado, Mitre C., et al.
Published: (2022)
Constricting the Computational Complexity Gap of the $4$-Coloring Problem in $(P_t,C_3)$-free Graphs
by: Jaworska, Justyna, et al.
Published: (2025)
by: Jaworska, Justyna, et al.
Published: (2025)
Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
by: Anil, Arun, et al.
Published: (2023)
by: Anil, Arun, et al.
Published: (2023)
On the structure of (dart, odd hole)-free graphs
by: Hoàng, Chính T.
Published: (2025)
by: Hoàng, Chính T.
Published: (2025)
$\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
by: Zaker, Manouchehr
Published: (2024)
by: Zaker, Manouchehr
Published: (2024)
Vertex evaluation of multiplex graphs using Forman Curvature
by: Yamada, Taiki
Published: (2025)
by: Yamada, Taiki
Published: (2025)
Weakly toll convexity and proper interval graphs
by: Dourado, Mitre C., et al.
Published: (2022)
by: Dourado, Mitre C., et al.
Published: (2022)
On z-coloring and ${\rm b}^{\ast}$-coloring of graphs as improved variants of the b-coloring
by: Zaker, Manouchehr
Published: (2024)
by: Zaker, Manouchehr
Published: (2024)
Determining distances and consensus between mutation trees
by: Cunha, Luís, et al.
Published: (2025)
by: Cunha, Luís, et al.
Published: (2025)
Computing the permanental polynomial of $4k$-intercyclic bipartite graphs
by: Bapat, Ravindra B., et al.
Published: (2024)
by: Bapat, Ravindra B., et al.
Published: (2024)
Characterizations of graph classes via convex geometries: a survey
by: Dourado, Mitre C., et al.
Published: (2022)
by: Dourado, Mitre C., et al.
Published: (2022)
On the Complexity of Distance-$d$ Independent Set Reconfiguration
by: Hoang, Duc A.
Published: (2022)
by: Hoang, Duc A.
Published: (2022)
The strong vertex span of trees
by: Grašič, Mateja, et al.
Published: (2024)
by: Grašič, Mateja, et al.
Published: (2024)
Deduction, Constrained Zero Forcing, and Constrained Searching
by: Burgess, Andrea, et al.
Published: (2024)
by: Burgess, Andrea, et al.
Published: (2024)
Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems
by: Grigoriev, Alexander, et al.
Published: (2025)
by: Grigoriev, Alexander, et al.
Published: (2025)
The 2-domination number of cylindrical graphs
by: Martínez, José Antonio, et al.
Published: (2024)
by: Martínez, José Antonio, et al.
Published: (2024)
(Even hole, triangle)-free graphs revisited
by: Martins, Beatriz, et al.
Published: (2026)
by: Martins, Beatriz, et al.
Published: (2026)
Characterizations of undirected 2-quasi best match graphs
by: Korchmaros, Annachiara, et al.
Published: (2025)
by: Korchmaros, Annachiara, et al.
Published: (2025)
Minimal $L^p$-congestion spanning trees on weighted graphs
by: Lafuente, Alberto Castejón, et al.
Published: (2025)
by: Lafuente, Alberto Castejón, et al.
Published: (2025)
Unavoidable induced subgraphs in graphs with complete bipartite induced minors
by: Chudnovsky, Maria, et al.
Published: (2024)
by: Chudnovsky, Maria, et al.
Published: (2024)
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
by: Furmańczyk, Hanna, et al.
Published: (2020)
by: Furmańczyk, Hanna, et al.
Published: (2020)
Maker-Maker games of rank 4 are PSPACE-complete
by: Galliot, Florian, et al.
Published: (2025)
by: Galliot, Florian, et al.
Published: (2025)
Token sliding independent set reconfiguration on block graphs
by: Francis, Mathew C., et al.
Published: (2024)
by: Francis, Mathew C., et al.
Published: (2024)
Removing bottlenecks in the recognition of small $(k,\ell)$-graph classes
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)
Token Jumping in Planar Graphs has Linear Sized Kernels
by: Cranston, Daniel W.
Published: (2024)
by: Cranston, Daniel W.
Published: (2024)
Algorithmic Applications of Tyshkevich's Graph Decomposition: A Primer and a Toolkit
by: Cheng, Christine T., et al.
Published: (2026)
by: Cheng, Christine T., et al.
Published: (2026)
Improved bounds for acyclic coloring parameters
by: Kirousis, Lefteris, et al.
Published: (2022)
by: Kirousis, Lefteris, et al.
Published: (2022)
Open Packing in Graphs: Bounds and Complexity
by: Shalu, M. A., et al.
Published: (2024)
by: Shalu, M. A., et al.
Published: (2024)
Combinatorial refinement on circulant graphs
by: Kluge, Laurence
Published: (2022)
by: Kluge, Laurence
Published: (2022)
Non-crossing $H$-graphs: a generalization of proper interval graphs admitting FPT algorithms
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)
On full-separating sets and related codes in graphs
by: Chakraborty, Dipayan, et al.
Published: (2024)
by: Chakraborty, Dipayan, et al.
Published: (2024)
Graph Burning: Bounds and Hardness
by: Antony, Dhanyamol, et al.
Published: (2024)
by: Antony, Dhanyamol, et al.
Published: (2024)
Temporal Reachability Dominating Sets: contagion in temporal graphs
by: Kutner, David C., et al.
Published: (2023)
by: Kutner, David C., et al.
Published: (2023)
A structural description of Zykov and Blanche Descartes graphs
by: Marin, Malory, et al.
Published: (2024)
by: Marin, Malory, et al.
Published: (2024)
m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs
by: Calamoneri, Tiziana, et al.
Published: (2025)
by: Calamoneri, Tiziana, et al.
Published: (2025)
The Minimum Eternal Vertex Cover Problem on a Subclass of Series-Parallel Graphs
by: Calamoneri, Tiziana, et al.
Published: (2025)
by: Calamoneri, Tiziana, et al.
Published: (2025)
On the hardness of recognizing graphs of small mim-width and its variants
by: la Tour, Max Dupré, et al.
Published: (2025)
by: la Tour, Max Dupré, et al.
Published: (2025)
Complexity results for a cops and robber game on directed graphs
by: Ben-Ameur, Walid, et al.
Published: (2024)
by: Ben-Ameur, Walid, et al.
Published: (2024)
On Computational Aspects of Ordered Matching Problems
by: Čertík, Michal, et al.
Published: (2025)
by: Čertík, Michal, et al.
Published: (2025)
On Computational Aspects of Cores of Ordered Graphs
by: Čertík, Michal, et al.
Published: (2025)
by: Čertík, Michal, et al.
Published: (2025)
Similar Items
-
Expanded-clique graphs and the domination problem
by: Dourado, Mitre C., et al.
Published: (2022) -
Constricting the Computational Complexity Gap of the $4$-Coloring Problem in $(P_t,C_3)$-free Graphs
by: Jaworska, Justyna, et al.
Published: (2025) -
Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
by: Anil, Arun, et al.
Published: (2023) -
On the structure of (dart, odd hole)-free graphs
by: Hoàng, Chính T.
Published: (2025) -
$\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
by: Zaker, Manouchehr
Published: (2024)