Pages that link to "Item:Q868347"
From MaRDI portal
The following pages link to Graph factors and factorization: 1985--2003: a survey (Q868347):
Displaying 50 items.
- A note on semi-coloring of graphs (Q354428) (← links)
- Sufficient condition for the existence of an even \([a,b]\)-factor in graph (Q354444) (← links)
- Optimal identification of sets of edges using 2-factors (Q389983) (← links)
- Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs (Q394360) (← links)
- Subdigraphs with orthogonal factorizations of digraphs (Q427789) (← links)
- On the complexity of deciding whether the regular number is at most two (Q497328) (← links)
- Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
- Factors and factorizations of graphs. Proof techniques in factor theory (Q547467) (← links)
- The existence of even regular factors of regular graphs on the number of cut edges (Q627564) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Edge-disjoint Hamilton cycles in graphs (Q713971) (← links)
- Induced claws and existence of even factors of graphs (Q723626) (← links)
- Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs (Q741726) (← links)
- Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs (Q844222) (← links)
- NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting (Q894461) (← links)
- Degree-bounded factorizations of bipartite multigraphs and of pseudographs (Q960926) (← links)
- Path factors and parallel knock-out schemes of almost claw-free graphs (Q968408) (← links)
- An algorithm for computing simple \(k\)-factors (Q987840) (← links)
- Computing sharp 2-factors in claw-free graphs (Q988693) (← links)
- Bipartite toughness and \(k\)-factors in bipartite graphs (Q1008540) (← links)
- On path factors of \((3,4)\)-biregular bigraphs (Q1014829) (← links)
- Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles (Q1637143) (← links)
- Matchings with lower quotas: algorithms and complexity (Q1702126) (← links)
- Uniform Lie algebras and uniformly colored graphs (Q1707419) (← links)
- Degree sequences and the existence of \(k\)-factors (Q1926057) (← links)
- Perfect matchings and \(K_{1,p}\)-restricted graphs (Q1996835) (← links)
- Connected \(k\)-factors in bipartite graphs (Q2092400) (← links)
- The existence of path-factor covered graphs (Q2107737) (← links)
- On \(P_{\geq 3}\)-factor deleted graphs (Q2115230) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Regular colorings in regular graphs (Q2175238) (← links)
- Factorizations of the product of cycles (Q2176166) (← links)
- On caterpillar factors in graphs (Q2210502) (← links)
- On specific factors in graphs (Q2227979) (← links)
- A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs (Q2229576) (← links)
- Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors (Q2243085) (← links)
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs (Q2328309) (← links)
- On the complexity landscape of connected \(f\)-factor problems (Q2414869) (← links)
- Stability number and \(f\)-factors in graphs (Q2441358) (← links)
- Packing bipartite graphs with covers of complete bipartite graphs (Q2442206) (← links)
- \(P_3\)-factors in the square of a tree (Q2657058) (← links)
- Edge decompositions and rooted packings of graphs (Q2675822) (← links)
- Component factors of the Cartesian product of graphs (Q2805953) (← links)
- On Cui-Kano's Characterization Problem on Graph Factors (Q2862548) (← links)
- Partitioning a Graph into Highly Connected Subgraphs (Q3188667) (← links)
- Approximation and Exact Algorithms for Special Cases of Connected f-Factors (Q3194728) (← links)
- An Extension of Cui-Kano's Characterization on Graph Factors (Q3466349) (← links)
- SEMIREGULAR FACTORIZATIONS OF REGULAR MULTIGRAPHS (Q3584596) (← links)
- Computing Sharp 2-Factors in Claw-Free Graphs (Q3599127) (← links)
- Latin squares with no small odd plexes (Q3614744) (← links)
