Generalizing \(D\)-graphs (Q2462386): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2007.06.017
@@ Property / DOI: 10.1016/j.dam.2007.06.017 / rank @@
-Normal rank
@@ Property / author @@
-Nathan Kahl
@@ Property / author: Nathan Kahl / rank @@
-Normal rank
@@ Property / author @@
+Nathan Kahl
@@ Property / author: Nathan Kahl / 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.2007.06.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2079211849
@@ Property / OpenAlex ID: W2079211849 / rank @@
+Normal rank
@@ Property / cites work @@
+Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
+Normal rank
@@ Property / cites work @@
+Tutte sets in graphs I: Maximal tutte sets and D-graphs
+Normal rank
@@ Property / cites work @@
+Q4398864
@@ Property / cites work: Q4398864 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+The extreme set condition of a graph
@@ Property / cites work: The extreme set condition of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4869540
@@ Property / cites work: Q4869540 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2007.06.017
@@ Property / DOI: 10.1016/J.DAM.2007.06.017 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2462386