The following pages link to (Q4227911):
Displaying 11 items.
- On partitioning a graph into two connected subgraphs (Q650911) (← links)
- Characterization of graphs dominated by induced paths (Q868348) (← links)
- Characterization of \(P_{6}\)-free graphs (Q881583) (← links)
- Infinite versus finite graph domination (Q968422) (← links)
- A new characterization of \(P_{6}\)-free graphs (Q972332) (← links)
- Complete description of forbidden subgraphs in the structural domination problem (Q1025505) (← links)
- Partitioning graphs into connected parts (Q1034603) (← links)
- Dominating subgraphs in graphs with some forbidden structures (Q1343259) (← links)
- On connected dominating sets of restricted diameter (Q2356248) (← links)
- Partitioning Graphs into Connected Parts (Q3392949) (← links)
- A New Characterization of P 6-Free Graphs (Q3511353) (← links)