Paired-domination number of claw-free odd-regular graphs
From MaRDI portal
Publication:2012885
DOI10.1007/S10878-016-0033-9zbMATH Open1376.90054OpenAlexW2401186295WikidataQ114225859 ScholiaQ114225859MaRDI QIDQ2012885FDOQ2012885
Baoyindureng Wu, Wei Yang, Xinhui An
Publication date: 3 August 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0033-9
Recommendations
Cites Work
- Paired-domination in claw-free cubic graphs
- Bounds on total domination in claw-free cubic graphs
- Paired-domination in graphs
- Title not available (Why is that?)
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- Paired domination on interval and circular-arc graphs
- Paired-domination in generalized claw-free graphs
- Tight bounds on maximal and maximum matchings
- Independent sets and matchings in subcubic graphs
- Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs
- Title not available (Why is that?)
- Graphs with large paired-domination number
- Paired domination in graphs: a survey and recent results
- A characterization of cubic graphs with paired-domination number three-fifths their order
- Paired-domination
- Paired-domination in claw-free graphs
Cited In (5)
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)
