Imagen de Portada

Reconstructing edge-deleted unicyclic graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Pizzimenti, Anthony E., Rakhimov, Umarkhon
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the complexity of edge subdivision to $H$-free graphs
por: Piecyk, Marta, et al.
Publicado: (2026)

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

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

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

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

Improved exploration of temporal graphs
por: Bastide, Paul, et al.
Publicado: (2025)

Distance Reconstruction of Sparse Random Graphs
por: Bastide, Paul
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Burning rooted graph products
por: Peca-Medlin, John
Publicado: (2026)

Perturbation results for distance-edge-monitoring numbers
por: Yang, Chenxu, et al.
Publicado: (2023)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
por: Bernshteyn, Anton, et al.
Publicado: (2024)

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

Short circuit walks in fixed dimension
por: Black, Alexander E., et al.
Publicado: (2025)

List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
por: Esmer, Barış Can, et al.
Publicado: (2022)

Smoothed analysis for graph isomorphism
por: Anastos, Michael, et al.
Publicado: (2024)

On graphs coverable by k shortest paths
por: Dumas, Maël, et al.
Publicado: (2022)

The Complexity of Homomorphism Reconstruction Revisited
por: Gervens, Timo, et al.
Publicado: (2026)

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

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

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

On the Houdré-Tetali conjecture about an isoperimetric constant of graphs
por: Lau, Lap Chi, et al.
Publicado: (2024)