Induced cycles in graphs

DOI10.1007/s00373-016-1713-zzbMath1353.05071arXiv1406.0606OpenAlexW1808305725MaRDI QIDQ503635

Christian Löwenstein, Michael A. Henning, Thomas Sasse, Felix Joos

Publication date: 13 January 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.0606

zbMATH Keywords

matchinginduced cycleclaw-free1-extendabilityinduced regular subgraphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Induced 2-regular subgraphs in \(k\)-chordal cubic graphs ⋮ Exact Solution Algorithms for the Chordless Cycle Problem ⋮ Independent point-set domination in line graphs ⋮ Induced subgraphs of a tree with constraint degree

Cites Work

• Unnamed Item
• Unnamed Item
• Locating-total domination in claw-free cubic graphs
• Parameterized complexity of finding regular induced subgraphs
• Matching theory
• Claw-free graphs---a survey
• Sparse regular induced subgraphs in \(2P_3\)-free graphs
• Maximum \(k\)-regular induced subgraphs
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• A Short Proof of the Factor Theorem for Finite Graphs

This page was built for publication: Induced cycles in graphs