Graph factors and factorization: 1985--2003: a survey
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4191727 (Why is no real title available?)
- scientific article; zbMATH DE number 3889577 (Why is no real title available?)
- scientific article; zbMATH DE number 3150487 (Why is no real title available?)
- scientific article; zbMATH DE number 3840005 (Why is no real title available?)
- scientific article; zbMATH DE number 3840007 (Why is no real title available?)
- scientific article; zbMATH DE number 3855160 (Why is no real title available?)
- scientific article; zbMATH DE number 3857160 (Why is no real title available?)
- scientific article; zbMATH DE number 3869380 (Why is no real title available?)
- scientific article; zbMATH DE number 4142085 (Why is no real title available?)
- scientific article; zbMATH DE number 3809601 (Why is no real title available?)
- scientific article; zbMATH DE number 3902701 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- scientific article; zbMATH DE number 3943865 (Why is no real title available?)
- scientific article; zbMATH DE number 3950582 (Why is no real title available?)
- scientific article; zbMATH DE number 3952821 (Why is no real title available?)
- scientific article; zbMATH DE number 3966125 (Why is no real title available?)
- scientific article; zbMATH DE number 4055663 (Why is no real title available?)
- scientific article; zbMATH DE number 4079448 (Why is no real title available?)
- scientific article; zbMATH DE number 4085704 (Why is no real title available?)
- scientific article; zbMATH DE number 4101256 (Why is no real title available?)
- scientific article; zbMATH DE number 4105006 (Why is no real title available?)
- scientific article; zbMATH DE number 4110739 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3654142 (Why is no real title available?)
- scientific article; zbMATH DE number 3655985 (Why is no real title available?)
- scientific article; zbMATH DE number 3674133 (Why is no real title available?)
- scientific article; zbMATH DE number 3704754 (Why is no real title available?)
- scientific article; zbMATH DE number 3717365 (Why is no real title available?)
- scientific article; zbMATH DE number 3726401 (Why is no real title available?)
- scientific article; zbMATH DE number 3743308 (Why is no real title available?)
- scientific article; zbMATH DE number 3753004 (Why is no real title available?)
- scientific article; zbMATH DE number 9573 (Why is no real title available?)
- scientific article; zbMATH DE number 15366 (Why is no real title available?)
- scientific article; zbMATH DE number 15866 (Why is no real title available?)
- scientific article; zbMATH DE number 25257 (Why is no real title available?)
- scientific article; zbMATH DE number 33169 (Why is no real title available?)
- scientific article; zbMATH DE number 47528 (Why is no real title available?)
- scientific article; zbMATH DE number 48089 (Why is no real title available?)
- scientific article; zbMATH DE number 90341 (Why is no real title available?)
- scientific article; zbMATH DE number 99003 (Why is no real title available?)
- scientific article; zbMATH DE number 165085 (Why is no real title available?)
- scientific article; zbMATH DE number 177842 (Why is no real title available?)
- scientific article; zbMATH DE number 3458807 (Why is no real title available?)
- scientific article; zbMATH DE number 3465360 (Why is no real title available?)
- scientific article; zbMATH DE number 3492724 (Why is no real title available?)
- scientific article; zbMATH DE number 3556149 (Why is no real title available?)
- scientific article; zbMATH DE number 3557552 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3603293 (Why is no real title available?)
- scientific article; zbMATH DE number 3628970 (Why is no real title available?)
- scientific article; zbMATH DE number 3628985 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3637930 (Why is no real title available?)
- scientific article; zbMATH DE number 3641462 (Why is no real title available?)
- scientific article; zbMATH DE number 1229732 (Why is no real title available?)
- scientific article; zbMATH DE number 1246225 (Why is no real title available?)
- scientific article; zbMATH DE number 1299961 (Why is no real title available?)
- scientific article; zbMATH DE number 1314686 (Why is no real title available?)
- scientific article; zbMATH DE number 1342133 (Why is no real title available?)
- scientific article; zbMATH DE number 554155 (Why is no real title available?)
- scientific article; zbMATH DE number 568806 (Why is no real title available?)
- scientific article; zbMATH DE number 653269 (Why is no real title available?)
- scientific article; zbMATH DE number 734469 (Why is no real title available?)
- scientific article; zbMATH DE number 979131 (Why is no real title available?)
- scientific article; zbMATH DE number 1011069 (Why is no real title available?)
- scientific article; zbMATH DE number 1033810 (Why is no real title available?)
- scientific article; zbMATH DE number 1033851 (Why is no real title available?)
- scientific article; zbMATH DE number 1101952 (Why is no real title available?)
- scientific article; zbMATH DE number 1117461 (Why is no real title available?)
- scientific article; zbMATH DE number 1156583 (Why is no real title available?)
- scientific article; zbMATH DE number 1161241 (Why is no real title available?)
- scientific article; zbMATH DE number 1990720 (Why is no real title available?)
- scientific article; zbMATH DE number 1467781 (Why is no real title available?)
- scientific article; zbMATH DE number 1501962 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 1769330 (Why is no real title available?)
- scientific article; zbMATH DE number 1769331 (Why is no real title available?)
- scientific article; zbMATH DE number 9993 (Why is no real title available?)
- scientific article; zbMATH DE number 944215 (Why is no real title available?)
- scientific article; zbMATH DE number 4116581 (Why is no real title available?)
- scientific article; zbMATH DE number 4116582 (Why is no real title available?)
- scientific article; zbMATH DE number 4121434 (Why is no real title available?)
- scientific article; zbMATH DE number 3796005 (Why is no real title available?)
- scientific article; zbMATH DE number 3010471 (Why is no real title available?)
- scientific article; zbMATH DE number 1833096 (Why is no real title available?)
- scientific article; zbMATH DE number 1839834 (Why is no real title available?)
- scientific article; zbMATH DE number 1916553 (Why is no real title available?)
- scientific article; zbMATH DE number 1916884 (Why is no real title available?)
- scientific article; zbMATH DE number 2111180 (Why is no real title available?)
- scientific article; zbMATH DE number 798653 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 863471 (Why is no real title available?)
- scientific article; zbMATH DE number 863475 (Why is no real title available?)
- scientific article; zbMATH DE number 894692 (Why is no real title available?)
- scientific article; zbMATH DE number 913257 (Why is no real title available?)
- scientific article; zbMATH DE number 1420729 (Why is no real title available?)
- scientific article; zbMATH DE number 3893248 (Why is no real title available?)
- scientific article; zbMATH DE number 4193709 (Why is no real title available?)
- scientific article; zbMATH DE number 969172 (Why is no real title available?)
- scientific article; zbMATH DE number 2188395 (Why is no real title available?)
- scientific article; zbMATH DE number 2188396 (Why is no real title available?)
- scientific article; zbMATH DE number 2188446 (Why is no real title available?)
- scientific article; zbMATH DE number 2197948 (Why is no real title available?)
- scientific article; zbMATH DE number 3243267 (Why is no real title available?)
- scientific article; zbMATH DE number 3257169 (Why is no real title available?)
- scientific article; zbMATH DE number 3390836 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- scientific article; zbMATH DE number 3415898 (Why is no real title available?)
- scientific article; zbMATH DE number 3424062 (Why is no real title available?)
- 1-Factors and Antifactor Sets
- 1-factorizing regular graphs of high degree - an improved bound
- 2-factors in claw-free graphs
- K4−‐factor in a graph
- k -Factors and Neighbourhoods of Independent Sets in Graphs
- A General Criterion for the Existence of Transversals
- A Short Proof of the Factor Theorem for Finite Graphs
- A \([k,k+1]\)-factor containing a given Hamiltonian cycle
- A bibliographic survey of edge‐colorings
- A characterization of graphs having all (g,f)-factors
- A degree condition for the existence of \([a,b]\)-factors in \(K_{1,n}\)-free graphs
- A degree condition for the existence ofk-factors
- A generalization of Tutte's 1-factor theorem to countable graphs
- A homology theory for spanning tress of a graph
- A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
- A neighborhood condition for graphs to have \([a, b]\)-factors. II
- A neighbourhood condition for graphs to have \([a,b]\)-factors
- A note concerning graphs with unique f-factors
- A note on the complexity of finding regular subgraphs
- A remark on the factor theorems of lovász and tutte
- A review of random graphs
- A simple existence criterion for \((g<f)\)-factors
- A sufficient condition for a bipartite graph to have a k‐factor
- A sufficient condition for a graph to have \([a,b]\)-factors
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
- Advances on the Hamiltonian problem -- a survey
- Algorithms for constructing graphs and digraphs with given valences and factors
- All regular multigraphs of even order and high degree are 1-factorable
- Almost Every Graph can be Covered by Linear Forests
- Almost‐regular factorization of graphs
- An Ore-type condition for the existence of \(k\)-factors in graphs
- An algorithmic proof of Tutte's f-factor theorem
- An extension of Tutte's 1-factor theorem
- An extension of matching theory
- BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
- Balanced network flows. III. Strongly polynomial augmentation algorithms
- Balanced network flows. IV: Duality and structure theory.
- Binding number and minimum degree for k-factors
- Binding numbers and \(f\)-factors of graphs
- Bipartite Edge Coloring in $O(\Delta m)$ Time
- COVERING AND PACKING IN GRAPHS, I.
- Canonical edge-colourings of locally finite graphs
- Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
- Closure, 2-factors, and cycle coverings in claw-free graphs
- Complete bipartite factorisations by complete bipartite graphs
- Complete bipartite factorisations of \(K _{n,n}\)
- Complete factors and \(f\)-factors
- Complexity of the hamiltonian cycle in regular graph problem
- Complexité de l'arboricité linéaire d'un graphe II
- Component factors and induced subgraphs
- Connected \((g,f)\)-factors
- Connected \([a,b]\)-factors in graphs
- Connected \([k,k+1]\)-factors of graphs
- Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor
- Connected factors in graphs -- a survey
- Convexity of degree sequences
- Counting 1-factors in regular bipartite graphs
- Covering and packing in graphs IV: Linear arboricity
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
- Decomposing 4-Regular Graphs into Triangle-Free 2-Factors
- Decomposing infinite graphs
- Decomposition of Complete Graphs into Isomorphic Factors with a Given Diameter
- Decomposition of \(K_n\) into subgraphs of prescribed type
- Decomposition of graphs into \((g,f)\)-factors
- Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters
- Degree conditions for 2-factors
- Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle
- Disjoint factors of diameter two in complete graphs
- Distinct representatives of subsets
- Dynamic matchings and quasidynamic fractional matchings. II
- Edge coloring regular graphs of high degree
- Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk
- Edge-Coloring Bipartite Graphs
- Efficient algorithms for Petersen's matching theorem
- Embedding k -Regular Graphs in k + 1-Regular Graphs
- Every 4-regular graph plus an edge contains a 3-regular subgraph
- Extending matchings in graphs: A survey
- F-factors of graphs: A generalized matching problem
- FACTORIZATION OF EVEN GRAPHS
- Factorizations of regular graphs
- Factorizations of regular graphs of high degree
- Factors and connected induced subgraphs
- Factors and factorizations of graphs—a survey
- Factors and induced subgraphs
- Factors of regular graphs
- Faktoren in unendlichen Graphen. (Factors in infinite graphs)
- Faster scaling algorithms for general graph matching problems
- Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs
- Fractional \((g,f)\)-factors in graphs
- Fractional \((g,f)\)-factors of graphs
- Fractional \(k\)-factors of graphs
- Fractional matchings and the Edmonds-Gallai theorem
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Graph colouring and the probabilistic method
- Graph decomposition with constraints on the connectivity and minimum degree
- Graph decomposition: A new key to coding theorems
- Graph decompositions without isolated vertices
- Graph decompositions without isolated vertices III
- Graph decompositions without isolated vertices. II
- Graph factorization, general triple systems, and cyclic triple systems
- Graph factors
- Independence number, connectivity, and r‐factors
- Infinite matching theory
- Injective choice functions
- Injective choice functions for countable families
- Integer and Fractional Matchings
- Isomorphic Factorisations. I: Complete Graphs
- Isomorphic Factorization of Regular Graphs and 3-Regular Multigraphs
- Isomorphic factorization of r-regular graphs into r parts
- Isomorphic factorizations VII. Regular graphs and tournaments
- Isomorphic factorizations of complete equipartite graphs
- König's Duality Theorem for Infinite Bipartite Graphs
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- Linear arboricity and linear \(k\)-arboricity of regular graphs
- Linear arboricity of random regular graphs
- Matchable infinite graphs
- Matching theory
- Matchings in Countable Graphs
- Matchings in graphs. II
- Matchings in infinite graphs
- Matchings in infinite graphs
- Maximal tight sets and the Edmonds-Gallai decomposition for matchings
- Maximum graphs with a unique k-factor
- Minimum degree of bipartite graphs and the existence of k-factors
- More sufficient conditions for a graph to have factors
- Neighborhood conditions and k-factors
- Odd and even factors with given properties
- Odd factors of a graph
- Odd subgraphs and matchings
- On 2-factors in claw-free graphs
- On Factors of a Graph
- On Representatives of Subsets
- On Restricted Two-Factors
- On a 2-factor with a specified edge in a graph satisfying the Ore condition
- On a conjecture of bollobás and bosák
- On barrier sets of star-factors
- On certain classes of fractional matchings
- On circuits in graphs
- On connected factors in \(K_{1,3}\)-free graphs
- On defect-d matchings in graphs
- On f-factors of a graph
- On factors in random graphs
- On factors with all degrees odd
- On factors with given components
- On generalized matching problems
- On neighborhood condition for graphs to have [\(a\), \(b\)]-factors
- On packing 3-vertex paths in a graph
- On regular factors in regular graphs with small radius
- On the Complexity of General Graph Factor Problems
- On the Computational Complexity of Combinatorial Problems
- On the Problem of Decomposing a Graph into n Connected Factors
- On the bipartite case of El-Zahár's conjecture
- On the completeness of a generalized matching problem
- On the complexity of some edge-partition problems for graphs
- On the existence of a factor of degree one of a connected random graph
- On the maximal number of independent circuits in a graph
- On the number of 1-factorizations of the complete graph
- On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs
- On the relationship between the genus and the cardinality of the maximum matchings of a graph
- On the strength of König's duality theorem for infinite bipartite graphs
- On the structure of graphs with a unique \(k\)-factor
- On the structure of graphs with a uniquek-factor
- On unique \(k\)-factors and unique \([1,k]\)-factors in graphs.
- One-factor in random graphs based on vertex choice
- One-factorizations of the complete graph—A survey
- One-factors and \(k\)-factors
- Optimal packing of induced stars in a graph
- Packing subgraphs in a graph
- Packings by Complete Bipartite Graphs
- Partition of graphs with condition on the connectivity and minimum degree
- Path factors in claw-free graphs
- Path factors in cubic graphs
- Paths in graphs
- Paths, Trees, and Flowers
- Perfect Matchings in Random r-regular, s-uniform Hypergraphs
- Perfect matchings in random s‐uniform hypergraphs
- Perfect triangle-free 2-matchings
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- Recent progress on edge-colouring graphs
- Regular Multigraphs of High Degree are 1-Factorizable
- Regular factors in K1,n free graphs
- Regular factors in nearly regular graphs
- Regular factors in regular multipartite graphs
- Regular factors in regular multipartite graphs
- Regular factors of regular graphs
- Regular factors of simple regular graphs and factor-spectra
- Regular graphs, regular factors, and the impact of Petersen's theorems
- Regular subgraphs of almost regular graphs
- Rounding in symmetric matrices and undirected graphs
- Simplified existence theorems for \((g,f)\)-factors
- Some Properties of Graphs with Multiple Edges
- Some conditions for the existence off-factors
- Some problems about \(r\)-factorizations of complete graphs
- Some problems about linear arboricity
- Some results on linear arboricity
- Some results on odd factors of graphs
- Spanning subgraphs with specified valencies
- Star arboricity
- Star-factors andk-bounded total domination
- Strong transfinite version of König's duality theorem
- Structure theorem and algorithm on \((1,f)\)-odd subgraph
- Subgraphs of graphs. I
- Subgraphs with prescribed valencies
- Sufficient conditions for a graph to have factors
- Sufficient conditions for graphs to have \((g,f)\)-factors
- Sufficient conditions for matchings
- The Complexity of Enumeration and Reliability Problems
- The Factorization of Linear Graphs
- The Factors of Graphs
- The NP-Completeness of Edge-Coloring
- The NP-Completeness of Some Edge-Partition Problems
- The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
- The Planar Hamiltonian Circuit Problem is NP-Complete
- The complexity of computing the permanent
- The complexity of regular subgraph recognition
- The fractional matching numbers of graphs
- The general maximum matching algorithm of Micali and Vazirani
- The k-factor conjecture is true
- The linear arboricity of graphs
- The number of matchings in random regular graphs and bipartite graphs
- The overfull conjecture and the conformability conjecture
- The solution of van der Waerden's problem for permanents
- Three-regular parts of four-regular graphs
- Three‐regular subgraphs of four‐regular graphs
- Tough graphs and Hamiltonian circuits.
- Toughness and the existence ofk-factors
- Toughness of graphs and the existence of factors
- Two sufficient conditions for a 2-factor in a bipartite graph
- Two‐factors each component of which contains a specified vertex
- Unique maximum matching algorithms
- Unique maximum matching algorithms
- Updating the hamiltonian problem—A survey
- Valencies of graphs with 1-factors
- Vertex-disjoint claws in graphs
- Vertex-disjoint cycles containing specified edges
- Vertex‐disjoint cycles containing prescribed vertices
- [a,b]‐factorizations of graphs
- [a,b]-factorization of a graph
- [a,b]-factors of graphs
- \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs
- \(f\)-optimal factors of infinite graphs
Cited in
(71)- Connected factors in graphs -- a survey
- Improved degree conditions for 2-factors with k cycles in Hamiltonian graphs
- Stability number and f-factors in graphs
- Edge decompositions and rooted packings of graphs
- Remarks on restricted fractional \((g, f)\)-factors in graphs
- Degree sequences and the existence of \(k\)-factors
- An overview of graph covering and partitioning
- Factors and factorizations of graphs—a survey
- Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- Assessing the computational complexity of multi-layer subgraph detection
- Path factors and parallel knock-out schemes of almost claw-free graphs
- The existence of path-factor covered graphs
- Factorizations of the product of cycles
- Maximal sets of factors
- Partitioning a graph into highly connected subgraphs
- On \(P_{\geq 3}\)-factor deleted graphs
- Factors and factorizations of graphs. Proof techniques in factor theory
- Spanning trees: A survey
- Subdigraphs with orthogonal factorizations of digraphs
- Approximation and exact algorithms for special cases of connected \(f\)-factors
- Binding number and path-factor critical deleted graphs
- Induced claws and existence of even factors of graphs
- Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube
- Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles
- Perfect matchings in graphs with prescribed local restrictions
- Bipartite toughness and \(k\)-factors in bipartite graphs
- A sufficient condition for the existence of restricted fractional (g, f)-factors in graphs
- On caterpillar factors in graphs
- On path factors of \((3,4)\)-biregular bigraphs
- Packing bipartite graphs with covers of complete bipartite graphs
- Degree-bounded factorizations of bipartite multigraphs and of pseudographs
- Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs
- 2-factors of regular graphs: an updated survey
- \(P_3\)-factors in the square of a tree
- Component factors of the Cartesian product of graphs
- Optimal identification of sets of edges using 2-factors
- An algorithm for computing simple \(k\)-factors
- Perfect matchings and \(K_{1,p}\)-restricted graphs
- On Cui-Kano's characterization problem on graph factors
- NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting
- Note on the factors of graphs
- On specific factors in graphs
- The existence of even regular factors of regular graphs on the number of cut edges
- Semiregular factorizations of regular multigraphs
- A note on semi-coloring of graphs
- Sufficient condition for the existence of an even \([a,b]\)-factor in graph
- A neighborhood condition for graphs to have restricted fractional (g,f)-factors
- An extension of Cui-Kano's characterization on graph factors
- Computing Sharp 2-Factors in Claw-Free Graphs
- Edge-disjoint Hamilton cycles in graphs
- Regular colorings in regular graphs
- \(P_k\)-factors in squares and line graphs of trees
- Degree conditions for path-factors in graphs
- Improved queue-size scaling for input-queued switches via graph factorization
- On the complexity of deciding whether the regular number is at most two
- Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
- Latin squares with no small odd plexes
- Construction of k-matchings in graph products
- Latin hexahedra and related combinatorial structures
- Editing to Connected F-Degree Graph
- Connected \(k\)-factors in bipartite graphs
- On the complexity landscape of connected \(f\)-factor problems
- On a conjecture that strengthens Kundu's \(k\)-factor theorem
- Matchings with lower quotas: algorithms and complexity
- Isolated toughness and path-factor uniform graphs. II.
- Packing $k$-Matchings and $k$-Critical Graphs
- Uniform Lie algebras and uniformly colored graphs
- Some results about component factors in graphs
- Computing sharp 2-factors in claw-free graphs
- Algorithmic complexity of weakly semiregular partitioning and the representation number
This page was built for publication: Graph factors and factorization: 1985--2003: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868347)
