A sufficient condition for a graph to have \([a,b]\)-factors (Q1173656): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Factors and factorizations of graphs—a survey
@@ Property / cites work: Factors and factorizations of graphs—a survey / rank @@
+Normal rank
@@ Property / cites work @@
+On factors with given components
@@ Property / cites work: On factors with given components / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect matchings of a graph
@@ Property / cites work: Perfect matchings of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4187840
@@ Property / cites work: Q4187840 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4156806
@@ Property / cites work: Q4156806 / rank @@
+Normal rank
@@ Property / cites work @@
+Some results on odd factors of graphs
@@ Property / cites work: Some results on odd factors of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for a bipartite graph to have a <i>k</i>‐factor
+Normal rank
@@ Property / cites work @@
+Subgraphs with prescribed valencies
@@ Property / cites work: Subgraphs with prescribed valencies / rank @@
+Normal rank
@@ Property / cites work @@
+Graph factors
@@ Property / cites work: Graph factors / rank @@
+Normal rank
@@ Property / cites work @@
+The binding number of a graph and its Anderson number
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1173656