Pages that link to "Item:Q968213"
From MaRDI portal
The following pages link to A characterization of cubic graphs with paired-domination number three-fifths their order (Q968213):
Displayed 10 items.
- Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph (Q509625) (← links)
- An upper bound on the paired-domination number in terms of the number of edges in the graph (Q710582) (← links)
- A characterization of graphs with disjoint dominating and paired-dominating sets (Q719018) (← links)
- Total domination versus paired-domination in regular graphs (Q1708402) (← links)
- Paired-domination in claw-free graphs with minimum degree at least three (Q1730243) (← links)
- Paired-domination number of claw-free odd-regular graphs (Q2012885) (← links)
- Graphs with maximum size and given paired-domination number (Q2449089) (← links)
- Upper bounds for the paired-domination numbers of graphs (Q2631089) (← links)
- Paired-domination in claw-free graphs (Q2637727) (← links)
- My Favorite Domination Conjectures in Graph Theory Are Bounded (Q5506786) (← links)