Cover Image

Families of tractable problems with respect to vertex-interval-membership width and its generalisations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Enright, Jessica, Hand, Samuel D., Larios-Jones, Laura, Meeks, Kitty
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Structural Parameters for Dense Temporal Graphs
by: Enright, Jessica, et al.
Published: (2024)

Reachability in temporal graphs under perturbation
by: Enright, Jessica, et al.
Published: (2024)

Approximating temporal modularity on graphs of small underlying treewidth
by: Agdur, Vilhelm, et al.
Published: (2025)

Temporal Orienteering with Changing Fuel Costs
by: Corsini, Timothée, et al.
Published: (2025)

Parameterised algorithms for temporally satisfying reconfiguration problems
by: Davot, Tom, et al.
Published: (2025)

Cops and Robbers on Multi-Layer Graphs
by: Enright, Jessica, et al.
Published: (2023)

Homomorphisms of (n,m)-graphs with respect to generalised switch
by: Sen, Sagnik, et al.
Published: (2022)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
by: Davot, Tom, et al.
Published: (2024)

Tangled Paths: A Random Graph Model from Mallows Permutations
by: Enright, Jessica, et al.
Published: (2021)

Temporal Reachability Dominating Sets: contagion in temporal graphs
by: Kutner, David C., et al.
Published: (2023)

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

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

Boundary vertices of Strongly Connected Digraphs with respect to `Sum Metric'
by: Anand, Bijo S., 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)

FO and MSO Model Checking on Temporal Graphs
by: Döring, Michelle, et al.
Published: (2026)

A Vizing-like theorem for union vertex-distinguishing edge coloring
by: Bousquet, Nicolas, et al.
Published: (2016)

Parameterized Algorithms for Balanced Cluster Edge Modification Problems
by: Madathil, Jayakrishnan, et al.
Published: (2024)

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

All Graphs with at most 8 nodes are 2-interval-PCGs
by: Calamoneri, Tiziana, et al.
Published: (2022)

Ramanujan Graphs and Interlacing Families
by: Srivastava, Nikhil
Published: (2024)

Families without $s$-matchings: the other end
by: Kupavskii, Andrey, et al.
Published: (2026)

Speeding up random walk mixing by starting from a uniform vertex
by: Díaz, Alberto Espuny, et al.
Published: (2022)

On de Bruijn Rings and Families of Almost Perfect Maps
by: Stelldinger, Peer
Published: (2024)

Analogues of Bermond-Bollobás Conjecture for Cages Yield Expander Families
by: Eze, Leonard Chidiebere, et al.
Published: (2024)

On the complexity of the Maker-Breaker happy vertex game
by: Hilaire, Mathieu, et al.
Published: (2026)

The Hajnal--Rothschild problem
by: Frankl, Peter, et al.
Published: (2025)

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

Three aspects of the MSTCI problem
by: Dubinsky, Manuel, et al.
Published: (2023)

The red-blue-yellow matching problem
by: Aprile, Manuel, et al.
Published: (2026)

Throttling for metric dimension and its variants
by: Brimkov, Boris, et al.
Published: (2025)

Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges
by: Bok, Jan, et al.
Published: (2021)

Directed branch-width: A directed analogue of tree-width
by: Bumpus, Benjamin Merlin, et al.
Published: (2020)

A note on the Alon-Saks-Seymour problem
by: Fox, Jacob
Published: (2026)

Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
by: Schneider, Samuel, et al.
Published: (2025)

On the Modular Chromatic Index of Random Hypergraphs
by: Carenini, Gaia, et al.
Published: (2025)

Fault tolerance for metric dimension and its variants
by: Geneson, Jesse, et al.
Published: (2025)

On rigid regular graphs and a problem of Babai and Pultr
by: Knauer, Kolja, et al.
Published: (2025)

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

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