(d,1)-total labeling of graphs with a given maximum average degree (Q3376692): Difference between revisions

@@ Property / author @@
-Andre Raspaud
@@ Property / author: Andre Raspaud / rank @@
-Normal rank
@@ Property / author @@
+Andre Raspaud
@@ Property / author: Andre Raspaud / 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.1002/jgt.20124
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20124 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4235429310
@@ Property / OpenAlex ID: W4235429310 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum partition of a matroid into independent subsets
+Normal rank
@@ Property / cites work @@
+Q4535043
@@ Property / cites work: Q4535043 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3376692