A Short Proof of the Factor Theorem for Finite Graphs
From MaRDI portal
Publication:5826303
DOI10.4153/CJM-1954-033-3zbMath0055.17102WikidataQ29307726 ScholiaQ29307726MaRDI QIDQ5826303
Publication date: 1954
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Noncontextual coloring of orthogonality hypergraphs ⋮ On parallel complexity of maximum f-matching and the degree sequence problem ⋮ Local Dirac's condition on the existence of 2-factor ⋮ Simple reduction of f-colorings to edge-colorings ⋮ A graph-based decomposition method for convex quadratic optimization with indicators ⋮ Approximations for the Steiner multicycle problem ⋮ Existence of 2-factors in tough graphs without forbidden subgraphs ⋮ How many matchings cover the nodes of a graph? ⋮ Diverse Pairs of Matchings ⋮ INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS ⋮ Signed graph factors and degree sequences ⋮ Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs ⋮ Unnamed Item ⋮ The Nonnegative Node Weight j-Restricted k-Matching Problems ⋮ A note on f-factors in directed and undirected multigraphs ⋮ Graph realizations constrained by skeleton graphs ⋮ General factors of graphs ⋮ Additive approximation of generalized Turán questions ⋮ Remarks on regular factors of regular graphs ⋮ A note on parallel complexity of maximum \(f\)-matching ⋮ Approximate Max \(k\)-Cut with subgraph guarantee ⋮ Maximal-\(\Gamma\)-prime Graphen ⋮ Factors and factorizations of graphs—a survey ⋮ Gallai-Edmonds decomposition as a pruning technique ⋮ Generalized Hypergraph Matching via Iterated Packing and Local Ratio ⋮ On graphs admitting two disjoint maximum independent sets ⋮ The stable fixtures problem with payments ⋮ Approximation and Exact Algorithms for Special Cases of Connected f-Factors ⋮ The \(\beta\)-assignment problem in general graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Cut-edges and regular factors in regular graphs of odd degree ⋮ At most \(k\)-to-1 mappings between graphs. II ⋮ Configurations with few crossings in topological graphs ⋮ Independent edges in bipartite graphs obtained from orientations of graphs ⋮ Regular factors of regular graphs ⋮ Unnamed Item ⋮ Disjoint stable matchings in linear time ⋮ On the complexity landscape of connected \(f\)-factor problems ⋮ Vizing's 2-factor conjecture involving toughness and maximum degree conditions ⋮ Total coloring and total matching: polyhedra and facets ⋮ An algorithmic approach to dual integrality of matching and extensions ⋮ Regular factors and eigenvalues of regular graphs ⋮ An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach ⋮ Editing graphs to satisfy degree constraints: a parameterized approach ⋮ On the Number of α-Orientations ⋮ Graphs associated with vector spaces of even dimension: A link with differential geometry ⋮ f-factors and related decompositions of graphs ⋮ On Petersen's graph theorem ⋮ Subgraphs and their degree sequences of a digraph ⋮ On the threshold for \(k\)-regular subgraphs of random graphs ⋮ Negative examples for sequential importance sampling of binary contingency tables ⋮ Packing $k$-Matchings and $k$-Critical Graphs ⋮ Polyhedron of triangle-free simple 2-matchings in subcubic graphs ⋮ The switch Markov chain for sampling irregular graphs and digraphs ⋮ A compact linear program for testing optimality of perfect matchings. ⋮ Indestructive deletions of edges from graphs ⋮ Graph factors ⋮ Trees with 1-factors and oriented trees ⋮ Approximating bounded-degree spanning trees and connected factors with leaves ⋮ Perfect matchings in total domination critical graphs ⋮ Neighborhood conditions and edge-disjoint perfect matchings ⋮ Optimal covers with Hamilton cycles in random graphs ⋮ Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search ⋮ Best monotone degree conditions for graph properties: a survey ⋮ Weighted matching as a generic pruning technique applied to optimization constraints ⋮ The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond ⋮ Approximation algorithms for connected graph factors of minimum weight ⋮ Induced cycles in graphs ⋮ On multicolour noncomplete Ramsey graphs of star graphs ⋮ Binding numbers and \(f\)-factors of graphs ⋮ Matching theory -- a sampler: From Dénes König to the present ⋮ Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm ⋮ Graph editing problems with extended regularity constraints ⋮ On the Swap-Distances of Different Realizations of a Graphical Degree Sequence ⋮ A cubic kernel for feedback vertex set and loop cutset ⋮ A note concerning graphs with unique f-factors ⋮ Matchings in graphs. II ⋮ Realization of a sum of sequences by a sum graph ⋮ A factorization theorem for a certain class of graphs ⋮ Tough graphs and Hamiltonian circuits. (Reprint) ⋮ Spanning subgraphs with specified valencies. (Reprint) ⋮ Finding maximum square-free 2-matchings in bipartite graphs ⋮ Navigating between packings of graphic sequences ⋮ Characterization of self-complementary graphs with 2-factors ⋮ Editing to a planar graph of given degrees ⋮ Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications ⋮ Good characterizations for some degree constrained subgraphs ⋮ Approximation algorithm for maximum edge coloring ⋮ Intelligent Solutions for Curve Reconstruction Problem ⋮ Open rectangle-of-influence drawings of inner triangulated plane graphs ⋮ Approximation algorithms for multi-criteria traveling salesman problems ⋮ Regular factors of line graphs ⋮ Graphs and Subgraphs ⋮ \(\beta\)-neighborhood closures for graphs ⋮ The Stable Fixtures Problem with Payments ⋮ On Hamilton's ideals ⋮ Maximum balanced flow in a network ⋮ Faktorklassen in Graphen ⋮ Independence number, connectivity, and r‐factors ⋮ Tough graphs and Hamiltonian circuits.
This page was built for publication: A Short Proof of the Factor Theorem for Finite Graphs
