A lower bound on the number of removable ears of 1-extendable graphs (Q966053): Difference between revisions

@@ Property / author @@
+Shao-hui Zhai
@@ Property / author: Shao-hui Zhai / rank @@
+Normal rank
@@ Property / author @@
+Cláudio Leonardo Lucchesi
@@ Property / author: Cláudio Leonardo Lucchesi / 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.2009.10.024
+Normal rank
@@ Property / OpenAlex ID @@
+W2064437555
@@ Property / OpenAlex ID: W2064437555 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3424771
@@ Property / cites work: Q3424771 / rank @@
+Normal rank
@@ Property / cites work @@
+Ear decompositions of matching covered graphs
@@ Property / cites work: Ear decompositions of matching covered graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Matching structure and the matching lattice
@@ Property / cites work: Matching structure and the matching lattice / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+On n-extendable graphs
@@ Property / cites work: On n-extendable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5319150
@@ Property / cites work: Q5319150 / rank @@
+Normal rank