The following pages link to Paths, Stars and the Number Three (Q4715272):
Displaying 43 items.
- Restricted domination parameters in graphs (Q2467572) (← links)
- Domination in graphs of minimum degree at least two and large girth (Q2482352) (← links)
- Domination in graphs of minimum degree five (Q2494122) (← links)
- On domination in connected cubic graphs (Q2576833) (← links)
- Domination number of graphs with minimum degree five (Q2656332) (← links)
- A note on domination number in maximal outerplanar graphs (Q2659167) (← links)
- A note on vertices contained in the minimum dominating set of a graph with minimum degree three (Q2699220) (← links)
- Minimum Degree and Dominating Paths (Q2958208) (← links)
- Domination number of cubic graphs with large girth (Q3113283) (← links)
- A note on the double Roman domination number of graphs (Q3297013) (← links)
- (Q3297136) (← links)
- On Domination Number of 4-Regular Graphs (Q3366679) (← links)
- Signed and Minus Dominating Functions in Graphs (Q3384612) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- Independent Domination in Cubic Graphs (Q3466348) (← links)
- Three tree-paths (Q3475297) (← links)
- An upper bound for domination number of 5-regular graphs (Q3599930) (← links)
- A linear vizing-like relation between the size and the domination number of a graph (Q4261185) (← links)
- Total domination in graphs with minimum degree three (Q4487071) (← links)
- Graphs with large total domination number (Q4508619) (← links)
- Domination in planar graphs with small diameter* (Q4537553) (← links)
- Minimum independent dominating sets of random cubic graphs (Q4803314) (← links)
- On the domination number of a graph and its block graph (Q5057740) (← links)
- Domination versus disjunctive domination in graphs (Q5233919) (← links)
- Domination in Cubic Graphs of Large Girth (Q5302753) (← links)
- My Favorite Domination Conjectures in Graph Theory Are Bounded (Q5506786) (← links)
- (Q5708625) (← links)
- On the domination number of a graph and its total graph (Q5858178) (← links)
- Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets (Q5862679) (← links)
- (Q5863477) (← links)
- Induced path factors of regular graphs (Q6055940) (← links)
- On the path partition number of 6‐regular graphs (Q6057632) (← links)
- Partial domination in supercubic graphs (Q6080128) (← links)
- Partial domination and irredundance numbers in graphs (Q6096253) (← links)
- Domination number and feedback vertex number of complements of line graphs (Q6101458) (← links)
- A note on bounds for the broadcast domination number of graphs (Q6130225) (← links)
- On the path partition of graphs (Q6137690) (← links)
- (Q6150889) (← links)
- The extended dominating sets in graphs (Q6542990) (← links)
- Best possible upper bounds on the restrained domination number of cubic graphs (Q6565811) (← links)
- Domination of triangulated discs and maximal outerplanar graphs (Q6585486) (← links)
- The decycling number of a line graph (Q6646413) (← links)
- Packing 2- and 3-stars into \(( 2 , 3 )\)-regular graphs (Q6657246) (← links)
