Cover Image

Beyond recognizing well-covered graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Feghali, Carl, Marin, Malory, Watrigant, Rémi
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A structural description of Zykov and Blanche Descartes graphs
by: Marin, Malory, et al.
Published: (2024)

Channel allocation revisited through 1-extendability of graphs
by: Busson, Anthony, et al.
Published: (2024)

Solution to a problem of Katona on counting cliques of weighted graphs
by: Borg, Peter, et al.
Published: (2022)

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

On graphs coverable by chubby shortest paths
by: Hatzel, Meike, 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)

Extremal minimal bipartite matching covered graphs
by: Mallik, Amit Kumar, et al.
Published: (2024)

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

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
by: Deák, Bence, et al.
Published: (2026)

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

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
by: Baste, Julien, et al.
Published: (2025)

Non-dissective coverings by planks
by: Kupavskii, Andrey, et al.
Published: (2025)

Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent Sets
by: Marin, Malory
Published: (2025)

The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability
by: Feghali, Carl, et al.
Published: (2025)

Intersecting families with covering number $3$
by: Kupavskii, Andrey
Published: (2024)

Computational complexity of covering regular trees
by: Bok, Jan, et al.
Published: (2025)

Facial diagrams and cycle double cover
by: Ghanbari, Babak, et al.
Published: (2026)

Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)

On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)

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

Effects of graph operations on star pairwise compatibility graphs
by: Monti, Angelo, et al.
Published: (2024)

Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)

Compression with wildcards: Enumerating specific induced subgraphs, and packing them as well
by: Wild, Marcel
Published: (2024)

On covering cubic graphs with three perfect matchings
by: Máčajová, Edita, et al.
Published: (2025)

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

Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies
by: Soltani, Hossein, et al.
Published: (2018)

Beyond Outerplanarity
by: Chaplick, Steven, et al.
Published: (2017)

Diameter of the inversion graph
by: Havet, Frédéric, et al.
Published: (2024)

Colouring t-perfect graphs
by: Chudnovsky, Maria, et al.
Published: (2024)

Contractions in perfect graph
by: Dupont-Bouillard, Alexandre, et al.
Published: (2024)

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

On the expansion of Hanoi graphs
by: Eppstein, David, et al.
Published: (2025)

On total transitivity of graphs
by: Santra, Kamal
Published: (2025)

Linear colorings of graphs
by: Hilaire, Claire, et al.
Published: (2025)

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

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

New bounds for the optimal density of covering single-insertion codes via the Turán density
by: Pikhurko, Oleg, et al.
Published: (2024)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
by: Chakraborty, Dibyayan, et al.
Published: (2025)