Independence and matching number in graphs with maximum degree 4 (Q2439118): Difference between revisions

@@ Property / cites work @@
+Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Q5508779
@@ Property / cites work: Q5508779 / rank @@
+Normal rank
@@ Property / cites work @@
+Independent sets and matchings in subcubic graphs
@@ Property / cites work: Independent sets and matchings in subcubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Independence in graphs with maximum degree four
@@ Property / cites work: Independence in graphs with maximum degree four / rank @@
+Normal rank
@@ Property / cites work @@
+A bound on the chromatic number of graphs without certain induced subgraphs
+Normal rank