Induced 2-regular subgraphs in \(k\)-chordal cubic graphs

DOI10.1016/j.dam.2016.01.009zbMath1333.05203arXiv1406.2438OpenAlexW1542253437MaRDI QIDQ266935

Dieter Rautenbach, Michael A. Henning, Felix Joos, Christian Löwenstein

Publication date: 7 April 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

independent setinduced matchinginduced cycleinduced regular subgraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Partitioning the vertices of a cubic graph into two total dominating sets

Cites Work

• Unnamed Item
• Unnamed Item
• A Dirac-type characterization of \(k\)-chordal graphs
• Fair domination in graphs
• Induced cycles in graphs
• Parameterized complexity of finding regular induced subgraphs
• Treewidth for graphs with small chordality
• Sparse regular induced subgraphs in \(2P_3\)-free graphs
• Dirac-type characterizations of graphs without long chordless cycles
• Maximum \(k\)-regular induced subgraphs
• Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems

This page was built for publication: Induced 2-regular subgraphs in \(k\)-chordal cubic graphs