Graph factors and factorization: 1985--2003: a survey
From MaRDI portal
Recommendations
Cites work
Too many MaRDI portal entities accessed. Number of entities loaded: 250/250.
Cited in
(81)- Bipartite toughness and \(k\)-factors in bipartite graphs
- On path factors of \((3,4)\)-biregular bigraphs
- Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles
- Matchings with lower quotas: algorithms and complexity
- Uniform Lie algebras and uniformly colored graphs
- Connected factors in graphs -- a survey
- Degree sequences and the existence of k-factors
- Perfect matchings and \(K_{1,p}\)-restricted graphs
- Connected \(k\)-factors in bipartite graphs
- The existence of path-factor covered graphs
- On \(P_{\geq 3}\)-factor deleted graphs
- An overview of graph covering and partitioning
- Regular colorings in regular graphs
- Factorizations of the product of cycles
- On caterpillar factors in graphs
- On specific factors in graphs
- A sufficient condition for the existence of restricted fractional (g, f)-factors in graphs
- Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- On the complexity landscape of connected \(f\)-factor problems
- Stability number and f-factors in graphs
- Packing bipartite graphs with covers of complete bipartite graphs
- \(P_3\)-factors in the square of a tree
- Edge decompositions and rooted packings of graphs
- Component factors of the Cartesian product of graphs
- On Cui-Kano's characterization problem on graph factors
- Partitioning a graph into highly connected subgraphs
- Approximation and exact algorithms for special cases of connected f-factors
- Maximal sets of factors
- An extension of Cui-Kano's characterization on graph factors
- A note on semi-coloring of graphs
- Sufficient condition for the existence of an even \([a,b]\)-factor in graph
- Semiregular factorizations of regular multigraphs
- Computing Sharp 2-Factors in Claw-Free Graphs
- Latin squares with no small odd plexes
- Factors and factorizations of graphs—a survey
- Optimal identification of sets of edges using 2-factors
- Improved degree conditions for 2-factors with k cycles in Hamiltonian graphs
- Subdigraphs with orthogonal factorizations of digraphs
- Packing $k$-Matchings and $k$-Critical Graphs
- On the complexity of deciding whether the regular number is at most two
- A neighborhood condition for graphs to have restricted fractional (g,f)-factors
- Improved queue-size scaling for input-queued switches via graph factorization
- Construction of k-matchings in graph products
- Editing to Connected F-Degree Graph
- Some results about component factors in graphs
- Assessing the computational complexity of multi-layer subgraph detection
- Algorithmic complexity of weakly semiregular partitioning and the representation number
- 2-factors of regular graphs: an updated survey
- Note on the factors of graphs
- Factors and factorizations of graphs. Proof techniques in factor theory
- Perfect matchings in graphs with prescribed local restrictions
- \(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
- Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube
- The existence of even regular factors of regular graphs on the number of cut edges
- Remarks on restricted fractional (g, f)-factors in graphs
- Spanning trees: A survey
- Degree conditions for path-factors in graphs
- On a conjecture that strengthens Kundu's k-factor theorem
- On star polynomials of digraphs and their applications to domination
- Some results on the k-strong parity property in a graph
- Characterizing path-factor uniform graphs with respect to the degree sum of non-adjacent vertices
- Realizing graphs with cut constraints
- Alignment and comparison of directed networks via transition couplings of random walks
- A strongly polynomial-time algorithm for weighted general factors with three feasible degrees
- Sufficient conditions for the existence of path-factors with given properties
- Edge-disjoint Hamilton cycles in graphs
- Induced claws and existence of even factors of graphs
- Eigenvalues and factors: a survey
- 2-factor with at most two components under a degree sum condition
- Parameterised holant problems
- Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs
- Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
- NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting
- Degree-bounded factorizations of bipartite multigraphs and of pseudographs
- Path factors and parallel knock-out schemes of almost claw-free graphs
- An algorithm for computing simple \(k\)-factors
- Computing sharp 2-factors in claw-free graphs
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)
