Pages that link to "Item:Q5826303"

The following pages link to A Short Proof of the Factor Theorem for Finite Graphs (Q5826303):

Displaying 50 items.

• A note on parallel complexity of maximum \(f\)-matching (Q293199) (← links)
• Approximate Max \(k\)-Cut with subgraph guarantee (Q293220) (← links)
• Gallai-Edmonds decomposition as a pruning technique (Q301487) (← links)
• Regular factors and eigenvalues of regular graphs (Q404439) (← links)
• An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
• Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
• Graphs associated with vector spaces of even dimension: A link with differential geometry (Q417560) (← links)
• Optimal covers with Hamilton cycles in random graphs (Q484550) (← links)
• Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
• Weighted matching as a generic pruning technique applied to optimization constraints (Q490152) (← links)
• Induced cycles in graphs (Q503635) (← links)
• Graph editing problems with extended regularity constraints (Q526874) (← links)
• Perfect matchings in total domination critical graphs (Q659733) (← links)
• Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm (Q686268) (← links)
• Editing to a planar graph of given degrees (Q730508) (← links)
• Regular factors of line graphs (Q750467) (← links)
• Faktorklassen in Graphen (Q772016) (← links)
• Covers, orientations and factors (Q785575) (← links)
• Regular factors in nearly regular graphs (Q795844) (← links)
• Sufficient conditions for a graph to have factors (Q803162) (← links)
• Additive approximation of generalized Turán questions (Q832525) (← links)
• Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
• Configurations with few crossings in topological graphs (Q876504) (← links)
• On multicolour noncomplete Ramsey graphs of star graphs (Q947133) (← links)
• A cubic kernel for feedback vertex set and loop cutset (Q968273) (← links)
• Good characterizations for some degree constrained subgraphs (Q1003846) (← links)
• Approximation algorithm for maximum edge coloring (Q1007243) (← links)
• Open rectangle-of-influence drawings of inner triangulated plane graphs (Q1016532) (← links)
• Approximation algorithms for multi-criteria traveling salesman problems (Q1017906) (← links)
• \(\beta\)-neighborhood closures for graphs (Q1025907) (← links)
• A note on f-factors in directed and undirected multigraphs (Q1076696) (← links)
• General factors of graphs (Q1085185) (← links)
• f-factors and related decompositions of graphs (Q1147717) (← links)
• On Petersen's graph theorem (Q1148334) (← links)
• Subgraphs and their degree sequences of a digraph (Q1148915) (← links)
• Indestructive deletions of edges from graphs (Q1164646) (← links)
• Graph factors (Q1168989) (← links)
• Trees with 1-factors and oriented trees (Q1174177) (← links)
• Neighborhood conditions and edge-disjoint perfect matchings (Q1179275) (← links)
• Binding numbers and \(f\)-factors of graphs (Q1193563) (← links)
• Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
• Matchings in graphs. II (Q1214950) (← links)
• Characterization of self-complementary graphs with 2-factors (Q1238818) (← links)
• Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings (Q1305535) (← links)
• A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources (Q1306364) (← links)
• The \(\beta\)-assignment problem in general graphs (Q1370666) (← links)
• A compact linear program for testing optimality of perfect matchings. (Q1412705) (← links)
• Maximum balanced flow in a network (Q1569079) (← links)
• The stable fixtures problem with payments (Q1651275) (← links)
• The switch Markov chain for sampling irregular graphs and digraphs (Q1704570) (← links)