A note on connected domination number and leaf number (Q2099474): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2022.113228
@@ Property / DOI: 10.1016/j.disc.2022.113228 / rank @@
-Normal rank
@@ Property / author @@
+Phillip Mafuta
@@ Property / author: Phillip Mafuta / rank @@
+Normal rank
@@ Property / author @@
+Bernardo Gabriel Rodrigues
@@ Property / author: Bernardo Gabriel Rodrigues / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2022.113228
+Normal rank
@@ Property / OpenAlex ID @@
+W4307958165
@@ Property / OpenAlex ID: W4307958165 / rank @@
+Normal rank
@@ Property / cites work @@
+Transversal numbers of uniform hypergraphs
@@ Property / cites work: Transversal numbers of uniform hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
+Normal rank
@@ Property / cites work @@
+Connected Domination and Spanning Trees with Many Leaves
+Normal rank
@@ Property / cites work @@
+Bounds on the connected domination number of a graph
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum leaf number of cubic graphs
@@ Property / cites work: On the minimum leaf number of cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning trees in graphs of minimum degree 4 or 5
@@ Property / cites work: Spanning trees in graphs of minimum degree 4 or 5 / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning trees with many leaves in cubic graphs
@@ Property / cites work: Spanning trees with many leaves in cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368729
@@ Property / cites work: Q4368729 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Domination in Graphs Applied to Electric Power Networks
+Normal rank
@@ Property / cites work @@
+Domination, radius, and minimum degree
@@ Property / cites work: Domination, radius, and minimum degree / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning Trees with Many Leaves
@@ Property / cites work: Spanning Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the leaf number in graphs of girth 4 or 5
+Normal rank
@@ Property / cites work @@
+Spanning paths and cycles in triangle-free graphs
@@ Property / cites work: Spanning paths and cycles in triangle-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the leaf number in graphs with forbidden subgraphs
+Normal rank
@@ Property / cites work @@
+Hamiltonicity, minimum degree and leaf number
@@ Property / cites work: Hamiltonicity, minimum degree and leaf number / rank @@
+Normal rank
@@ Property / cites work @@
+Radius, leaf number, connected domination number and minimum degree
+Normal rank
@@ Property / cites work @@
+Minimum Degree, Leaf Number, and Hamiltonicity
@@ Property / cites work: Minimum Degree, Leaf Number, and Hamiltonicity / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning trees: A survey
@@ Property / cites work: Spanning trees: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Arbres avec un nombre maximum de sommets pendants
@@ Property / cites work: Arbres avec un nombre maximum de sommets pendants / rank @@
+Normal rank
@@ Property / cites work @@
+Q3895508
@@ Property / cites work: Q3895508 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing full spanning trees for cubic graphs
@@ Property / cites work: Constructing full spanning trees for cubic graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2022.113228
@@ Property / DOI: 10.1016/J.DISC.2022.113228 / rank @@
+Normal rank