|
|
| Property / cites work |
| | |
| Property / cites work: A generalization of Tutte's 1-factor theorem to countable graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: König's Duality Theorem for Infinite Bipartite Graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Matchings in infinite graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Infinite matching theory / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the strength of König's duality theorem for infinite bipartite graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3222884 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A General Criterion for the Existence of Transversals / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3907606 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Covering and packing in graphs IV: Linear arboricity / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Factors and factorizations of graphs—a survey / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Almost‐regular factorization of graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The linear arboricity of graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4222171 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Regular subgraphs of almost regular graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Every 4-regular graph plus an edge contains a 3-regular subgraph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Star arboricity / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Linear arboricity and linear \(k\)-arboricity of regular graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On factors with all degrees odd / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On factors with given components / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Sufficient conditions for matchings / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Path factors in claw-free graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: An algorithmic proof of Tutte's f-factor theorem / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Simplified existence theorems for \((g,f)\)-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4018552 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: More sufficient conditions for a graph to have factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4229268 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Integer and Fractional Matchings / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4390607 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Regular factors in nearly regular graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Decomposing 4-Regular Graphs into Triangle-Free 2-Factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Efficient Algorithms for Petersen's Matching Theorem / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4038720 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3852212 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3682518 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Paths in graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4487074 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5202206 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The number of matchings in random regular graphs and bipartite graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Regular factors of regular graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Disjoint factors of diameter two in complete graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3998644 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5545297 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: König-Egerváry graphs, 2-bicritical graphs and fractional matchings / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4333458 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4044717 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Strong transfinite version of König's duality theorem / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4430886 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Subgraphs of graphs. I / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The complexity of regular subgraph recognition / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3211347 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q2704160 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: 2-factors in claw-free graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: 1-factorizing regular graphs of high degree - an improved bound / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3915022 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Tough graphs and Hamiltonian circuits. / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Three‐regular subgraphs of four‐regular graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4256358 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Perfect Matchings in Random <i>r</i>-regular, <i>s</i>-uniform Hypergraphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: An extension of matching theory / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Packing subgraphs in a graph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Perfect triangle-free 2-matchings / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the maximal number of independent circuits in a graph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Graph decomposition: A new key to coding theorems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Some results on odd factors of graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3999150 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3972516 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Decomposing infinite graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Paths, Trees, and Flowers / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5675543 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3791187 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Two‐factors each component of which contains a specified vertex / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Factors and induced subgraphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5461494 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Vertex-disjoint cycles containing specified edges / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Sufficient conditions for graphs to have \((g,f)\)-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4344205 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Regular factors in <i>K</i><sub>1,<i>n</i></sub> free graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Vertex-disjoint claws in graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3936847 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The solution of van der Waerden's problem for permanents / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3826608 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Isomorphic factorization of r-regular graphs into r parts / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Connected (g, f)-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Isomorphic Factorization of Regular Graphs and 3-Regular Multigraphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On circuits in graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Graph decompositions without isolated vertices / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Toughness and the existence ofk-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Graph decompositions without isolated vertices. II / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4333457 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A sufficient condition for a bipartite graph to have a <i>k</i>‐factor / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Complete factors and \(f\)-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5184947 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4190662 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the existence of a factor of degree one of a connected random graph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On 2-factors in claw-free graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A bibliographic survey of edge‐colorings / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3853641 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4371129 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4540086 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4540087 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4540088 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Balanced network flows. IV. Duality and structure theory / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Perfect matchings in random s‐uniform hypergraphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5461552 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Some Properties of Graphs with Multiple Edges / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Unique maximum matching algorithms / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Unique Maximum Matching Algorithms / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Faster scaling algorithms for general graph matching problems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Embedding <i>k</i> -Regular Graphs in <i>k</i> + 1-Regular Graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4198056 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Updating the hamiltonian problem—A survey / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Advances on the Hamiltonian problem -- a survey / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Some results on linear arboricity / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4887750 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4168622 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Some problems about linear arboricity / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Partition of graphs with condition on the connectivity and minimum degree / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Distinct representatives of subsets / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On Representatives of Subsets / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: COVERING AND PACKING IN GRAPHS, I. / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Isomorphic Factorisations. I: Complete Graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4190653 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4263715 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A simple existence criterion for \((g<f)\)-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On generalized matching problems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3929772 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Packings by Complete Bipartite Graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On Restricted Two-Factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Rounding in symmetric matrices and undirected graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Maximum graphs with a unique k-factor / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3829581 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Canonical edge-colourings of locally finite graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Factorizations of regular graphs of high degree / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Recent progress on edge-colouring graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3809815 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The overfull conjecture and the conformability conjecture / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q2708238 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4294597 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q2816105 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Regular factors in regular multipartite graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5466092 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On unique \(k\)-factors and unique \([1,k]\)-factors in graphs. / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On regular factors in regular graphs with small radius / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The NP-Completeness of Edge-Coloring / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The NP-Completeness of Some Edge-Partition Problems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Injective choice functions / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4713289 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: An Ore-type condition for the existence of \(k\)-factors in graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Neighborhood conditions and \(k\)-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Vertex‐disjoint cycles containing prescribed vertices / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A note concerning graphs with unique f-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4519896 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4857375 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4521492 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q2816108 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the bipartite case of El-Zahár's conjecture / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q2725320 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On a 2-factor with a specified edge in a graph satisfying the Ore condition / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3337508 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: [a,b]-factorization of a graph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3720642 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Factors of regular graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A sufficient condition for a graph to have \([a,b]\)-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Sufficient conditions for a graph to have factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Odd subgraphs and matchings / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Structure theorem and algorithm on \((1,f)\)-odd subgraph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: [a,b]-factors of graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Binding numbers and \(f\)-factors of graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Edge-Coloring Bipartite Graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A review of random graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4871754 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4142699 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the Computational Complexity of Combinatorial Problems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3325765 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Some conditions for the existence off-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3722541 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Two sufficient conditions for a 2-factor in a bipartite graph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Toughness of graphs and the existence of factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Minimum degree of bipartite graphs and the existence of k-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4488127 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4503098 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF <i>k</i>-FACTORS / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: <i>K</i><sub>4</sub><sup>−</sup>‐factor in a graph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Path factors in cubic graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Optimal packing of induced stars in a graph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the completeness of a generalized matching problem / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the Complexity of General Graph Factor Problems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Algorithms for constructing graphs and digraphs with given valences and factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4309143 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4754965 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Factors and connected induced subgraphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3267903 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Decomposition of Complete Graphs into Isomorphic Factors with a Given Diameter / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Connected \([a,b]\)-factors in graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Connected factors in graphs -- a survey / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The k-factor conjecture is true / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On f-factors of a graph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4074931 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: An extension of Tutte's 1-factor theorem / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4882964 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On connected factors in \(K_{1,3}\)-free graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5461495 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4807722 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On neighborhood condition for graphs to have [\(a\), \(b\)]-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4825265 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A \([k,k+1]\)-factor containing a given Hamiltonian cycle / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5284643 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4376498 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the number of 1-factorizations of the complete graph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On defect-d matchings in graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4731215 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4731216 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3834088 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4783148 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Fractional \((g,f)\)-factors of graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The fractional matching numbers of graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3972010 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the complexity of some edge-partition problems for graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5530470 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Subgraphs with prescribed valencies / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Valencies of graphs with 1-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A homology theory for spanning tress of a graph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Matching theory / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4734765 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4808027 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On Factors of a Graph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: [<i>a,b</i>]‐factorizations of graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4887674 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Connected \([k,k+1]\)-factors of graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3971718 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Complete bipartite factorisations by complete bipartite graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Complete bipartite factorisations of \(K _{n,n}\) / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A neighbourhood condition for graphs to have \([a,b]\)-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A neighborhood condition for graphs to have \([a, b]\)-factors. II / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4780524 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Matchings in graphs. II / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4198809 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4173401 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Linear arboricity of random regular graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Almost Every Graph can be Covered by Linear Forests / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3870933 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: One-factorizations of the complete graph—A survey / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4226448 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Graph colouring and the probabilistic method / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4344223 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: F-factors of graphs: A generalized matching problem / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On certain classes of fractional matchings / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3688439 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: \(f\)-optimal factors of infinite graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Matchable infinite graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3855216 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4033004 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A characterization of graphs having all \((g,f)\)-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Regular factors of simple regular graphs and factor-spectra / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3474680 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Independence number, connectivity, and r‐factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3988774 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A degree condition for the existence ofk-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4326198 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4892353 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4200077 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the relationship between the genus and the cardinality of the maximum matchings of a graph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Dynamic matchings and quasidynamic fractional matchings. II / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5659596 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5680158 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5686066 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Edge coloring regular graphs of high degree / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Complexité de l'arboricité linéaire d'un graphe II / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The general maximum matching algorithm of Micali and Vazirani / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Complexity of the hamiltonian cycle in regular graph problem / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Regular Multigraphs of High Degree are 1-Factorizable / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: All regular multigraphs of even order and high degree are 1-factorable / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4740601 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A note on the complexity of finding regular subgraphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Extending matchings in graphs: A survey / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4393233 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Injective choice functions for countable families / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Fractional matchings and the Edmonds-Gallai theorem / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4871750 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Isomorphic factorizations of complete equipartite graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: FACTORIZATION OF EVEN GRAPHS / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4715275 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3983103 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3715150 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4700525 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: One-factors and \(k\)-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4288148 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Decomposition of \(K_n\) into subgraphs of prescribed type / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3310655 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Bipartite Edge Coloring in $O(\Delta m)$ Time / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Counting 1-factors in regular bipartite graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3897156 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On factors in random graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: One-factor in random graphs based on vertex choice / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Graph factorization, general triple systems, and cyclic triple systems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Matchings in Countable Graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Maximal tight sets and the Edmonds-Gallai decomposition for matchings / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Faktoren in unendlichen Graphen. (Factors in infinite graphs) / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3323990 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4050646 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: 1-Factors and Antifactor Sets / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Three-regular parts of four-regular graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A remark on the factor theorems of lovász and tutte / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Graph decomposition with constraints on the connectivity and minimum degree / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A degree condition for the existence of \([a,b]\)-factors in \(K_{1,n}\)-free graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Binding number and minimum degree for k-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4129486 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3310658 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3734443 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Odd factors of a graph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3815343 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The Factorization of Linear Graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The Factors of Graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Spanning subgraphs with specified valencies / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Graph factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4133438 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The complexity of computing the permanent / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The Complexity of Enumeration and Reliability Problems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Regular graphs, regular factors, and the impact of Petersen's theorems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4332941 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3658026 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: <i>k</i> -Factors and Neighbourhoods of Independent Sets in Graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Isomorphic factorizations VII. Regular graphs and tournaments / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4248536 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4848778 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4944781 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Decomposition of graphs into \((g,f)\)-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q2765142 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On barrier sets of star-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4023009 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4337349 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Factorizations of regular graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3680871 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q2744319 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On a conjecture of bollobás and bosák / rank |
| | Normal rank |