Graph factors and factorization: 1985--2003: a survey

DOI10.1016/j.disc.2005.11.059zbMath1112.05088OpenAlexW2068431006WikidataQ62638537 ScholiaQ62638537MaRDI QIDQ868347

Publication date: 2 March 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.059

zbMATH Keywords

matching

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Assessing the Computational Complexity of Multi-layer Subgraph Detection, Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles, Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs, An overview of graph covering and partitioning, A neighborhood condition for graphs to have restricted fractional (g,f)-factors, Construction of k-matchings in graph products, Partitioning a Graph into Highly Connected Subgraphs, An Extension of Cui-Kano's Characterization on Graph Factors, Approximation and Exact Algorithms for Special Cases of Connected f-Factors, A note on semi-coloring of graphs, Sufficient condition for the existence of an even $[a,b$-factor in graph], $P_3$-factors in the square of a tree, Regular colorings in regular graphs, Factorizations of the product of cycles, Degree sequences and the existence of $k$-factors, Optimal identification of sets of edges using 2-factors, On the complexity landscape of connected $f$-factor problems, Improved degree conditions for 2-factors with $k$ cycles in Hamiltonian graphs, NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting, $P_k$-factors in squares and line graphs of trees, Binding number and path-factor critical deleted graphs, Isolated toughness and path-factor uniform graphs. II., Latin hexahedra and related combinatorial structures, The existence of even regular factors of regular graphs on the number of cut edges, Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube, Packing $k$-Matchings and $k$-Critical Graphs, Subdigraphs with orthogonal factorizations of digraphs, Matchings with lower quotas: algorithms and complexity, Uniform Lie algebras and uniformly colored graphs, On caterpillar factors in graphs, Stability number and $f$-factors in graphs, Unnamed Item, Packing bipartite graphs with covers of complete bipartite graphs, Spanning trees: A survey, On specific factors in graphs, A sufficient condition for the existence of restricted fractional $(g, f)$-factors in graphs, On the complexity of deciding whether the regular number is at most two, Nash-Williams conditions for the existence of all fractional $[a,b$-factors], Perfect matchings and $K_{1,p}$-restricted graphs, Degree-bounded factorizations of bipartite multigraphs and of pseudographs, Algorithmic complexity of weakly semiregular partitioning and the representation number, Path factors and parallel knock-out schemes of almost claw-free graphs, SEMIREGULAR FACTORIZATIONS OF REGULAR MULTIGRAPHS, Edge-disjoint Hamilton cycles in graphs, Computing Sharp 2-Factors in Claw-Free Graphs, An algorithm for computing simple $k$-factors, Computing sharp 2-factors in claw-free graphs, Induced claws and existence of even factors of graphs, Latin squares with no small odd plexes, Component factors of the Cartesian product of graphs, Bipartite toughness and $k$-factors in bipartite graphs, Minimum degree, independence number and pseudo $[2, b$-factors in graphs], On path factors of $(3,4)$-biregular bigraphs, Editing to Connected F-Degree Graph, Some results about component factors in graphs, Degree conditions for fractional $(a,b,k)$-critical covered graphs, Improved queue-size scaling for input-queued switches via graph factorization, Connected $k$-factors in bipartite graphs, On Cui-Kano's Characterization Problem on Graph Factors, The existence of path-factor covered graphs, On $P_{\geq 3}$-factor deleted graphs

Cites Work