Pages that link to "Item:Q4490780"
From MaRDI portal
The following pages link to Connected Domination and Spanning Trees with Many Leaves (Q4490780):
Displayed 41 items.
- Average degree conditions forcing a minor (Q259170) (← links)
- The 3-rainbow index and connected dominating sets (Q266041) (← links)
- Note on the upper bound of the rainbow index of a graph (Q298957) (← links)
- Improved bounds for spanning trees with many leaves (Q409458) (← links)
- Upper bounds on the \(k\)-forcing number of a graph (Q479006) (← links)
- Some results on spanning trees (Q601948) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Connected domination number of a graph and its complement (Q659759) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4 (Q744553) (← links)
- Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4 (Q744554) (← links)
- Connected domination of regular graphs (Q1025488) (← links)
- 2-connected graphs with small 2-connected dominating sets. (Q1402083) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Lower bounds on the number of leaves in spanning trees (Q1661497) (← links)
- Domination parameters of a graph and its complement (Q1692643) (← links)
- Some upper bounds for the 3-proper index of graphs (Q1714011) (← links)
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph (Q1752632) (← links)
- Bounds of the number of leaves of spanning trees in graphs without triangles (Q1930213) (← links)
- Bounds of the number of leaves of spanning trees (Q1930214) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- A note on connected domination number and leaf number (Q2099474) (← links)
- Bounds on domination parameters in graphs: a brief survey (Q2151205) (← links)
- Further results on the total monochromatic connectivity of graphs (Q2168754) (← links)
- Constructing a spanning tree with many leaves (Q2256702) (← links)
- Connected power domination in graphs (Q2424811) (← links)
- Bounds on the connected domination number of a graph (Q2446883) (← links)
- Matching properties in connected domination critical graphs (Q2470003) (← links)
- Traceability of connected domination critical graphs (Q2656675) (← links)
- Minimum Degree and Dominating Paths (Q2958208) (← links)
- On the Structure of Graphs Vertex Critical with Respect to Connected Domination (Q2971614) (← links)
- Connected Domination (Q3384607) (← links)
- Spanning Trees and Domination in Hypercubes (Q3390433) (← links)
- ANOTHER LOOK AT k-DOMINATION IN GRAPHS (Q4973417) (← links)
- Bounds on the leaf number in graphs of girth 4 or 5 (Q5035782) (← links)
- Partial domination - the isolation number of a graph (Q5162046) (← links)
- Spanning Trees with Many Leaves in Regular Bipartite Graphs (Q5387825) (← links)
- 2-edge connected dominating sets and 2-connected dominating sets of a graph (Q5963646) (← links)
- Spanning trees with few non-leaves (Q6076183) (← links)
- Connected domination in random graphs (Q6107484) (← links)
- Radius, leaf number, connected domination number and minimum degree (Q6110370) (← links)