On partitions of graphs under degree constraints (Q2357778): Difference between revisions

@@ Property / author @@
+Bao-Gang Xu
@@ Property / author: Bao-Gang Xu / 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.dam.2017.04.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2607945530
@@ Property / OpenAlex ID: W2607945530 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for decomposing graphs under degree constraints
+Normal rank
@@ Property / cites work @@
+Decomposing graphs with girth at least five under degree constraints
+Normal rank
@@ Property / cites work @@
+Q4820779
@@ Property / cites work: Q4820779 / rank @@
+Normal rank
@@ Property / cites work @@
+Partition of graphs with condition on the connectivity and minimum degree
+Normal rank
@@ Property / cites work @@
+On decomposition of triangle-free graphs under degree constraints
+Normal rank
@@ Property / cites work @@
+Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
+Normal rank
@@ Property / cites work @@
+Q4715286
@@ Property / cites work: Q4715286 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph decomposition with constraints on the connectivity and minimum degree
+Normal rank