The Price of Connectivity for Cycle Transversals
From MaRDI portal
Publication:2946410
DOI10.1007/978-3-662-48054-0_33zbMath1455.05076OpenAlexW2401451457MaRDI QIDQ2946410
Daniël Paulusma, Martin Milanič, Tatiana Romina Hartinger, Matthew Johnson
Publication date: 16 September 2015
Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/16141/1/16141.pdf
Paths and cycles (05C38) Transversal (matching) theory (05D15) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Cites Work
- Unnamed Item
- The price of connectivity for dominating set: upper bounds and complexity
- Connected vertex covers in dense graphs
- Connecting face hitting sets in planar graphs
- Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set
- On Hadwiger's Number and the Stability Number
- Perfect connected-dominant graphs
- The Price of Connectivity for Vertex Cover
- Connected Feedback Vertex Set in Planar Graphs