Feedback vertex set on Hamiltonian graphs
From MaRDI portal
Publication:2672436
DOI10.1007/978-3-030-86838-3_16OpenAlexW3203401487MaRDI QIDQ2672436
Till Fluschnik, Dario Cavallaro
Publication date: 8 June 2022
Full work available at URL: https://arxiv.org/abs/2104.05322
Cites Work
- A linear-time algorithm for drawing a planar graph on a grid
- Maximum independent sets in 3- and 4-regular Hamiltonian graphs
- On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
- Julius Petersen's theory of regular graphs
- On line graphs of subcubic triangle-free graphs
- Graph Theory
- On feedback vertex sets and nonseparating independent sets in cubic graphs
- 3-colorability of 4-regular hamiltonian graphs
- Reducibility among Combinatorial Problems
- k-ordered Hamiltonian graphs
- Multistage Vertex Cover
- A textbook of graph theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Feedback vertex set on Hamiltonian graphs