The Factors of Graphs

DOI10.4153/CJM-1952-028-2zbMath0049.24202OpenAlexW4256646394WikidataQ96161851 ScholiaQ96161851MaRDI QIDQ5816402

Publication date: 1952

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1952-028-2

zbMATH Keywords

topology

Related Items

A Pair of Forbidden Subgraphs and 2-Factors, Regular Graphs, Eigenvalues and Regular Factors, Remarks on regular factors of regular graphs, Maximal-$\Gamma$-prime Graphen, (k+1)-Cores Have k-Factors, Factors and factorizations of graphs—a survey, Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday), Regular factors in K_1,3‐free graphs, [a,b‐factorizations of graphs], Regular factors in K_1,n free graphs, The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity, Node-Balancing by Edge-Increments, Regular-factors in the complements of partial k-trees, Construction of k-matchings in graph products, Some Results on Fractional Graph Theory, Packings by Complete Bipartite Graphs, Path factors of bipartite graphs, Toughness and the existence ofk-factors, Approximation and Exact Algorithms for Special Cases of Connected f-Factors, Toughness, minimum degree, and the existence of 2‐factors, Sharp conditions for the existence of an even $[a,b$-factor in a graph], Unnamed Item, Spanning trees with leaf distance at least $d$, Neighborhood-union condition for an $[a, b$-factor avoiding a specified Hamiltonian cycle], $P_3$-factors in the square of a tree, Cut-edges and regular factors in regular graphs of odd degree, A degree condition for the existence ofk-factors, Regular factors of regular graphs, Decomposition theorems for square-free 2-matchings in bipartite graphs, Unnamed Item, Toughness, minimum degree, and the existence of 2‐factors, On the complexity landscape of connected $f$-factor problems, Unnamed Item, Nowhere-zero flows on tensor products of signed graphs, Fractional matching, factors and spectral radius in graphs involving minimum degree, An algorithmic approach to dual integrality of matching and extensions, Forbidden subgraphs and 2‐factors in 3/2‐tough graphs, Neighborhood unions and regular factors, $P_k$-factors in squares and line graphs of trees, Binding number and path-factor critical deleted graphs, A sufficient condition for the existence of a k-factor excluding a given r-factor, Ramsey Equivalence for Asymmetric Pairs of Graphs, Resolution of the Erdős–Sauer problem on regular subgraphs, The factorization of graphs. II, Packing $k$-Matchings and $k$-Critical Graphs, Binding number, $k$-factor and spectral radius of graphs, Unnamed Item, On perfect $k$-matchings, Edmonds polytopes and weakly hamiltonian graphs, On the structure of factorizable graphs. II, Some remarks about factors of graphs, Some conditions for the existence off-factors, Signed Graphs: From Modulo Flows to Integer-Valued Flows, Balanced network flows. IV. Duality and structure theory, On the Swap-Distances of Different Realizations of a Graphical Degree Sequence, Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree, Unnamed Item, Binding number and minimum degree for k-factors, Convexity of degree sequences, Factors and vertex-deleted subgraphs, Minimum node covers and 2-bicritical graphs, Spanning subgraphs with specified valencies. (Reprint), Finding maximum square-free 2-matchings in bipartite graphs, Uniform Sampling of Digraphs with a Fixed Degree Sequence, The $f$-factor problem for graphs and the hereditary property, 2- and 3-factors of graphs on surfaces, Über ein graphentheoretisches Ergebnis von T. Gallai, Signed graph factors and degree sequences, Toughness, minimum degree, and spanning cubic subgraphs, Graphs and Subgraphs, Nearly symmetric-indecomposable matrices, The k‐piece packing problem, Unnamed Item, Independence number, connectivity, and r‐factors, Optimum matching forests II: General weights, Extreme degree sequences of simple graphs, Approximate Hamilton decompositions of random graphs, A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron, Edge-disjoint Hamilton cycles in random graphs, Integer Flows and Modulo Orientations of Signed Graphs, Factors of Inserted Graphs, On $(g,f)$-uniform graphs, Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen, Vertices Belonging to All or to No Maximum Stable Sets of a Graph, A $\vec{P_3}$-decomposition of tournaments and bipartite digraphs, Parity results on connected f-factors, Complete-factors and ($g,f$)-factors, Graph realizations constrained by skeleton graphs, Factors of trees, Regular factors in vertex-deleted subgraphs of regular graphs, Regular factors in regular graphs, The number of trees with a 1-factor, General factors of graphs, Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles, Fractional matchings and the Edmonds-Gallai theorem, Matchings in infinite graphs, The 3-flow conjecture, factors modulo $k$, and the 1-2-3-conjecture, Connected $[k,k+1$-factors of graphs], Constructing a perfect matching is in random NC, Toughness and the existence of k-factors. II, Minimum degree, independence number and regular factors, An existence theorem on fractional deleted graphs, List edge and list total colourings of multigraphs, A characterization of graphs having all $(g,f)$-factors, A graphical proof of the nonexistence of BIB(7,b,r,3,$\lambda$ $| 16)$ designs, The membership problem in jump systems, A note on semi-coloring of graphs, Graph factors and factorization: 1985--2003: a survey, On factors with given components, Toughness, hamiltonicity and split graphs, Finding Hamiltonian cycles in Delaunay triangulations is NP-complete, Factors and induced subgraphs, Induced graph packing problems, Degree sequences and the existence of $k$-factors, $f$-factors, complete-factors, and component-deleted subgraphs, Regular factors and eigenvalues of regular graphs, A matching problem with side conditions, f-factors and related decompositions of graphs, Subgraphs and their degree sequences of a digraph, Generalized 1-factorization of trees, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Vertex-deleted subgraphs and regular factors from regular graph, Chordality and 2-factors in tough graphs, Graph factors, Trees with 1-factors and oriented trees, On the use of augmenting chains in chain packings, Optimal covers with Hamilton cycles in random graphs, An Ore-type condition for the existence of $k$-factors in graphs, One-factors and $k$-factors, On some factor theorems of graphs, $k$ -factors in regular graphs, On multicolour noncomplete Ramsey graphs of star graphs, $k$-regular subgraphs near the $k$-core threshold of a random graph, Infinite matching theory, Binding numbers and $f$-factors of graphs, Compatible 2-factors, Matching theory -- a sampler: From Dénes König to the present, Factors in graphs with odd-cycle property, A factorization theorem for a certain class of graphs, The existence of $k$-factors in squares of graphs, Edge-disjoint Hamilton cycles in graphs, On the minimum energy of regular graphs, On the factor-thickness of regular graphs, Finite homogeneous metric spaces, Approximation algorithm for maximum edge coloring, An extension of Tutte's 1-factor theorem, Über ein graphentheoretisches Problem von T. Gallai, Packing trees with constraints on the leaf degree, On barrier sets of star-factors, Toughness of graphs and the existence of factors, Lower bounds on matching energy of graphs, The stability number and connected $[k,k+1$-factor in graphs], Paths and cycles concerning independence edges, Odd path packings, Degree condition for the existence of a $k$-factor containing a given Hamiltonian cycle, On f-factors of a graph, Degree and stability number condition for the existence of connected factors in graphs, Generalized edge packings, Maximum balanced flow in a network, Packing paths of length at least two, Faktorklassen in Graphen, Bounds on maximum $b$-matchings, Minimal 2-matching-covered graphs, Coloring by two-way independent sets, 4-factors in 2-connected star-free graphs, Linear-time certifying algorithms for near-graphical sequences, Regular factors of simple regular graphs and factor-spectra, Matchings and matching extensions in graphs, $k$-regular factors and semi-$k$-regular factors in graphs, The method of alternating paths, Spanning subgraphs with specified valencies, Regular graph and some vertex-deleted subgraph, Disjoint paths in a rectilinear grid, Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem, Connected $k$-factors in bipartite graphs, Disconnected 2-factors in planar cubic bridgeless graphs, On certain classes of fractional matchings, Sufficient conditions for a graph to have factors, The existence of path-factor covered graphs, Proof of a conjecture on the spectral radius condition for $[a,b$-factors], Note on a zero net-regular signed graph, Minimum degree of a graph and the existence of k-factors, Bipartite double cover and perfect 2-matching covered graph with its algorithm, Factors of regular graphs