Dominating and large induced trees in regular graphs

DOI10.1016/j.disc.2007.03.043zbMath1127.05074OpenAlexW1986457224MaRDI QIDQ2463903

Dieter Rautenbach

Publication date: 6 December 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.043

zbMATH Keywords

regular graphcactusinduced dominating tree

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Decycling with a matching ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ Maximum weighted induced forests and trees: new formulations and a computational comparative review ⋮ The complexity of connected dominating sets and total dominating sets with specified induced subgraphs ⋮ A note on connected dominating sets of distance-hereditary graphs ⋮ On the existence of total dominating subgraphs with a prescribed additive hereditary property

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Trees in random graphs
• Induced forests in cubic graphs
• On the order of the largest induced tree in a random graph
• Maximal induces trees in sparse random graphs
• On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
• On linear and circular structure of (claw, net)-free graphs
• Acyclic domination
• Lower Bounds For Induced Forests in Cubic Graphs
• A parametric analysis of the largest induced tree problem in random graphs
• On feedback vertex sets and nonseparating independent sets in cubic graphs
• Decycling graphs

This page was built for publication: Dominating and large induced trees in regular graphs