Paired-domination number of claw-free odd-regular graphs
From MaRDI portal
(Redirected from Publication:2012885)
Recommendations
Cites work
- scientific article; zbMATH DE number 1185309 (Why is no real title available?)
- scientific article; zbMATH DE number 3657692 (Why is no real title available?)
- A characterization of cubic graphs with paired-domination number three-fifths their order
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- Bounds on total domination in claw-free cubic graphs
- Graphs with large paired-domination number
- Independent sets and matchings in subcubic graphs
- Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs
- Paired domination in graphs: a survey and recent results
- Paired domination on interval and circular-arc graphs
- Paired-domination
- Paired-domination in claw-free cubic graphs
- Paired-domination in claw-free graphs
- Paired-domination in generalized claw-free graphs
- Paired-domination in graphs
- Tight bounds on maximal and maximum matchings
Cited in
(6)- Cubic graphs have paired-domination number at most four-seventh of their orders
- Even pairs in claw-free perfect graphs
- Paired-domination in claw-free cubic graphs
- Domination versus total domination in claw-free cubic graphs
- Upper total domination in claw-free cubic graphs
- Triangles and (total) domination in subcubic graphs
This page was built for publication: Paired-domination number of claw-free odd-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012885)