Cover Image

On the complexity of edge subdivision to $H$-free graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Piecyk, Marta, Sandeep, R. B.
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Kernelization for list $H$-coloring for graphs with small vertex cover
by: Piecyk, Marta, et al.
Published: (2025)

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

Erdős-Gyárfás conjecture on graphs without long induced paths
by: Hegde, Anand Shripad, et al.
Published: (2024)

Reconstructing edge-deleted unicyclic graphs
by: Pizzimenti, Anthony E., et al.
Published: (2024)

Liar's vertex-edge domination in unit disk graph
by: Bhattacharya, Debojyoti, et al.
Published: (2025)

Liar's vertex-edge domination in subclasses of chordal graphs
by: Bhattacharya, Debojyoti, et al.
Published: (2025)

Sampling and counting triangle-free graphs near the critical density
by: Jenssen, Matthew, et al.
Published: (2024)

Switching Classes: Characterization and Computation
by: Antony, Dhanyamol, et al.
Published: (2024)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
by: Chudnovsky, Maria, et al.
Published: (2024)

Testing H-freeness on sparse graphs, the case of bounded expansion
by: Humeau, Samuel, et al.
Published: (2025)

A new width parameter of graphs based on edge cuts: $α$-edge-crossing width
by: Chang, Yeonsu, et al.
Published: (2023)

Algorithmic study on liar's vertex-edge domination problem
by: Bhattacharya, Debojyoti, et al.
Published: (2023)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
by: Bencs, Ferenc, et al.
Published: (2025)

On the complexity of global Roman domination problem in graphs
by: Reddy, Sangam Balchandar, et al.
Published: (2026)

Clique-free t-matchings in degree-bounded graphs
by: Paluch, Katarzyna, et al.
Published: (2024)

Improved exploration of temporal graphs
by: Bastide, Paul, et al.
Published: (2025)

Isolation critical graphs under multiple edge subdivision
by: Bartolo, Karl, et al.
Published: (2026)

A note on Ordered Ruzsa-Szemerédi graphs
by: Pratt, Kevin
Published: (2025)

Faithful universal graphs for minor-closed classes
by: Bastide, Paul, et al.
Published: (2025)

Constructing disjoint Steiner trees in Sierpiński graphs
by: Yang, Chenxu, et al.
Published: (2023)

On the complexity of finding a spanning even tree in a graph
by: Hanaka, Tesshu, et al.
Published: (2024)

Faster diameter computation in graphs of bounded Euler genus
by: Kluk, Kacper, et al.
Published: (2025)

Lower bounds for graph reconstruction with maximal independent set queries
by: Michel, Lukas, et al.
Published: (2024)

On $G^p$-unimodality of radius functions in graphs: structure and algorithms
by: Chalopin, Jérémie, et al.
Published: (2025)

On 2-strong connectivity orientations of mixed graphs and related problems
by: Georgiadis, Loukas, et al.
Published: (2023)

Interval H-graphs : Recognition and forbidden obstructions
by: Müller, Haiko, et al.
Published: (2025)

Making an oriented graph acyclic using inversions of bounded or prescribed size
by: Bang-Jensen, Jørgen, et al.
Published: (2025)

Eulerian-spanning set and coboundary operator: An investigation of maxcut beyond planar graphs
by: Fang, Qiming, et al.
Published: (2026)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
by: Bonamy, Marthe, et al.
Published: (2022)

Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
by: Biedl, Therese
Published: (2025)

Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs
by: Daga, Mohit
Published: (2025)

A refined graph container lemma and applications to the hard-core model on bipartite expanders
by: Jenssen, Matthew, et al.
Published: (2024)

The connectivity carcass of a vertex subset in a graph: both odd and even case
by: Baswana, Surender, et al.
Published: (2025)

Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs
by: Le, Hoang-Oanh, et al.
Published: (2024)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
by: Ghanbari, Babak, et al.
Published: (2025)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
by: Galby, Esther, et al.
Published: (2025)

Maximum Weight Independent Set in Hereditary Classes of Ordered Graphs
by: Bieliński, Paweł Rafał, et al.
Published: (2026)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
by: An, Shinwoo, et al.
Published: (2025)

Burning rooted graph products
by: Peca-Medlin, John
Published: (2026)

Isometric path complexity of graphs
by: Chakraborty, Dibyayan, et al.
Published: (2022)