The following pages link to The factorization of graphs. II (Q5659592):
Displaying 44 items.
- Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- \(\{k,r-k\}\)-factors of \(r\)-regular graphs (Q742594) (← links)
- Structure theorem and algorithm on \((1,f)\)-odd subgraph (Q878634) (← links)
- Elementary graphs with respect to \(f\)-parity factors (Q968209) (← links)
- Good characterizations for some degree constrained subgraphs (Q1003846) (← links)
- General factors of graphs (Q1085185) (← links)
- On some factor theorems of graphs (Q1185099) (← links)
- Factors in graphs with odd-cycle property (Q1210551) (← links)
- A characterization of graphs having all \((g,f)\)-factors (Q1366610) (← links)
- The membership problem in jump systems (Q1369649) (← links)
- Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts (Q1660265) (← links)
- Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming (Q1759676) (← links)
- A characterization for graphs having strong parity factors (Q2045389) (← links)
- Equitable factorizations of edge-connected graphs (Q2142698) (← links)
- Sufficient conditions for a graph to have all \([a, b]\)-factors and \((a, b)\)-parity factors (Q2147605) (← links)
- The superstar packing problem (Q2149487) (← links)
- Regular colorings in regular graphs (Q2175238) (← links)
- Characterization of 1-tough graphs using factors (Q2185904) (← links)
- \(\{0, 2 \}\)-degree free spanning forests in graphs (Q2339439) (← links)
- On edge connectivity and parity factor (Q2353240) (← links)
- Gadget classification (Q2366217) (← links)
- Quasi-Eulerian hypergraphs (Q2401411) (← links)
- A degree condition for a graph to have \((a,b)\)-parity factors (Q2411624) (← links)
- \([a,b]\)-factors of graphs on surfaces (Q2421864) (← links)
- Tractable cases of the extended global cardinality constraint (Q2430356) (← links)
- A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem (Q2466594) (← links)
- Degree constrained subgraphs (Q2482112) (← links)
- Path problems in skew-symmetric graphs (Q2563512) (← links)
- Ore-type conditions for the existence of even \([2,b]\)-factors in graphs (Q2576834) (← links)
- Ryser's theorem for \(\rho\)-Latin rectangles (Q2672929) (← links)
- On Cui-Kano's Characterization Problem on Graph Factors (Q2862548) (← links)
- Antifactors of regular bipartite graphs (Q3386611) (← links)
- An Extension of Cui-Kano's Characterization on Graph Factors (Q3466349) (← links)
- The Simple Reachability Problem in Switch Graphs (Q3599094) (← links)
- Monadic Second Order Logic on Graphs with Local Cardinality Constraints (Q3599161) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- Sharp conditions for the existence of an even $[a,b]$-factor in a graph (Q4991404) (← links)
- Maximum and optimal 1-2 matching problem of the different kind (Q5035028) (← links)
- (Q5089326) (← links)
- On the Saxl graph of a permutation group (Q5216084) (← links)
- A Tutte-Type Characterization for Graph Factors (Q5267996) (← links)
- Graph Orientation with Edge Modifications (Q5859684) (← links)
- Factors with red-blue coloring of claw-free graphs and cubic graphs (Q6166670) (← links)
