The Factors of Graphs

From MaRDI portal
Publication:5816402


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

William T. Tutte

Publication date: 1952

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



Related Items

Signed graph factors and degree sequences, The k‐piece packing problem, Unnamed Item, Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen, The factorization of graphs. II, Edmonds polytopes and weakly hamiltonian graphs, On the structure of factorizable graphs. II, Path factors of bipartite graphs, Toughness, minimum degree, and the existence of 2‐factors, Toughness, minimum degree, and the existence of 2‐factors, Neighborhood unions and regular factors, Unnamed Item, Toughness, minimum degree, and spanning cubic subgraphs, Independence number, connectivity, and r‐factors, On the factor-thickness of regular graphs, On factors with given components, Paths and cycles concerning independence edges, Odd path packings, Faktorklassen in Graphen, Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem, On certain classes of fractional matchings, Sufficient conditions for a graph to have factors, Graph factors and factorization: 1985--2003: a survey, The method of alternating paths, Disjoint paths in a rectilinear grid, Minimum degree of a graph and the existence of k-factors, Factors of regular graphs, Parity results on connected f-factors, The number of trees with a 1-factor, General factors of graphs, Fractional matchings and the Edmonds-Gallai theorem, Matchings in infinite graphs, Constructing a perfect matching is in random NC, Toughness and the existence of k-factors. II, A graphical proof of the nonexistence of BIB(7,b,r,3,\(\lambda\) \(| 16)\) designs, Factors and induced subgraphs, 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, Graph factors, Trees with 1-factors and oriented trees, On the use of augmenting chains in chain packings, An Ore-type condition for the existence of \(k\)-factors in graphs, One-factors and \(k\)-factors, On some factor theorems of graphs, 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, An extension of Tutte's 1-factor theorem, Über ein graphentheoretisches Problem von T. Gallai, Factors of trees, Regular factors in vertex-deleted subgraphs of regular graphs, Connected \([k,k+1\)-factors of graphs], List edge and list total colourings of multigraphs, A characterization of graphs having all \((g,f)\)-factors, The membership problem in jump systems, Maximum balanced flow in a network, 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, On barrier sets of star-factors, Toughness of graphs and the existence of factors, On f-factors of a graph, Generalized edge packings, Packing paths of length at least two, Spanning subgraphs with specified valencies, Disconnected 2-factors in planar cubic bridgeless graphs, Complete-factors and (\(g,f\))-factors, Minimum degree, independence number and regular factors, Toughness, hamiltonicity and split graphs, Finding Hamiltonian cycles in Delaunay triangulations is NP-complete, Chordality and 2-factors in tough graphs, A factorization theorem for a certain class of graphs, Regular factors in regular graphs, Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday), Factors and vertex-deleted subgraphs, Spanning subgraphs with specified valencies. (Reprint), Finding maximum square-free 2-matchings in bipartite graphs, The \(f\)-factor problem for graphs and the hereditary property, Extreme degree sequences of simple graphs, On \((g,f)\)-uniform graphs, Maximal-\(\Gamma\)-prime Graphen, Unnamed Item, Balanced network flows. IV. Duality and structure theory, Binding number and minimum degree for k-factors, Minimum node covers and 2-bicritical graphs, Graphs and Subgraphs, Factors of Inserted Graphs, A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron, Factors and factorizations of graphs—a survey, Packings by Complete Bipartite Graphs, Toughness and the existence ofk-factors, Regular factors of regular graphs, Unnamed Item, Some conditions for the existence off-factors, Optimum matching forests II: General weights, Unnamed Item, Vertices Belonging to All or to No Maximum Stable Sets of a Graph, Regular factors in K1,3‐free graphs, [a,b‐factorizations of graphs], Regular factors in K1,n free graphs, A degree condition for the existence ofk-factors, Unnamed Item, Über ein graphentheoretisches Ergebnis von T. Gallai