Cover Image

Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Biedl, Therese
Format:	Preprint
Published:	2025
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

Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
by: Biedl, Therese, et al.
Published: (2024)

On Computing Vertex Connectivity of 1-Plane Graphs
by: Biedl, Therese, et al.
Published: (2022)

Enumerating all minimal hitting sets in polynomial total time
by: Wild, Marcel
Published: (2023)

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

Finding maximum matchings in RDV graphs efficiently
by: Biedl, Therese, et al.
Published: (2024)

Enumerating minimal dominating sets and variants in chordal bipartite graphs
by: Castelo, Emanuel, et al.
Published: (2025)

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)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
by: Bonamy, Marthe, et al.
Published: (2020)

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

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

Using Ray-shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs
by: Biedl, Therese, et al.
Published: (2026)

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

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

Minor Containment and Disjoint Paths in almost-linear time
by: Korhonen, Tuukka, et al.
Published: (2024)

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
by: Korhonen, Tuukka, et al.
Published: (2024)

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

Improved space-time tradeoff for TSP via extremal set systems
by: Dallant, Justin, et al.
Published: (2026)

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

Efficient algorithms for the Potts model on small-set expanders
by: Carlson, Charles, et al.
Published: (2020)

An algorithmic Polynomial Freiman-Ruzsa theorem
by: Castro-Silva, Davi, et al.
Published: (2026)

Generalising the maximum independent set algorithm via Boolean networks
by: Gadouleau, Maximilien, et al.
Published: (2024)

Enumerating minimal solution sets for metric graph problems
by: Bergougnoux, Benjamin, et al.
Published: (2023)

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

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

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
by: Alecu, Bogdan, et al.
Published: (2024)

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

A faster algorithm for Vertex Cover parameterized by solution size
by: Harris, David G., et al.
Published: (2022)

Generating minimal redundant and maximal irredundant sets in incidence graphs
by: Castelo, Emanuel, et al.
Published: (2026)

Quasi-linear distance query reconstruction for graphs of bounded treelength
by: Bastide, Paul, et al.
Published: (2024)

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 edge subdivision to $H$-free graphs
by: Piecyk, Marta, et al.
Published: (2026)

Representative set statements for delta-matroids and the Mader delta-matroid
by: Wahlström, Magnus
Published: (2023)

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

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

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

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

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