Subgraphs with prescribed valencies
From MaRDI portal
Publication:5595084
DOI10.1016/S0021-9800(70)80033-3zbMath0198.29201OpenAlexW2066743906MaRDI QIDQ5595084
Publication date: 1970
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(70)80033-3
Related Items
Eigenvalues and [a,b‐factors in regular graphs], A proof of the Erdős-Faber-Lovász conjecture, Degree sequence optimization in bounded treewidth, Graph realizations: maximum degree in vertex neighborhoods, Degree factors with red-blue coloring of regular graphs, On the structure of factorizable graphs. II, Orthogonal factorizations of graphs, A generalization of orthogonal factorizations in graphs, A \([k,k+1\)-factor containing a given Hamiltonian cycle], Complete-factors and (\(g,f\))-factors, Factors of trees, A degree condition implying ore-type condition for even \([2,b\)-factors in graphs], Gadget classification, General factors of graphs, Biregular subgraphs of biregular graphs, Complexity of a disjoint matching problem on bipartite graphs, Some sufficient conditions for graphs to have (g, f)-factors, Orthogonal \((g,f)\)-factorizations in graphs, Some Results on Fractional Graph Theory, Stability number and [a,b‐factors in graphs], Packings by Complete Bipartite Graphs, An existence theorem on fractional deleted graphs, A characterization of graphs having all \((g,f)\)-factors, AN ORE-TYPE CONDITION FOR THE EXISTENCE OF EVEN [a,b-FACTORS IN GRAPHS], The membership problem in jump systems, Sufficient condition for the existence of an even \([a,b\)-factor in graph], Graph factors and factorization: 1985--2003: a survey, [a,b-factors of graphs], Neighborhood-union condition for an \([a, b\)-factor avoiding a specified Hamiltonian cycle], Fractional matchings, component-factors and edge-chromatic critical graphs, Sufficient conditions for graphs to have \((g,f)\)-factors, \((g,f)\)-factorizations of graphs orthogonal to \([1,2\)-subgraphs], Factors and induced subgraphs, Orthogonal \([k-1,k+1\)-factorizations in graphs], Decomposition of graphs with constraint on minimum degree, On degree sequence optimization, Optimization over degree sequences of graphs, Induced graph packing problems, Randomly orthogonal factorizations in networks, \((g,f)\)-factorizations orthogonal to a subgraph of a graph, A characterization of graphs without even factors, Unnamed Item, General fractional \(f\)-factor numbers of graphs, Regular factors and eigenvalues of regular graphs, Antifactors of regular bipartite graphs, Constructive extensions of two results on graphic sequences, Eigenvalues and parity factors in graphs with given minimum degree, f-factors and related decompositions of graphs, On Petersen's graph theorem, Subgraphs and their degree sequences of a digraph, The factorization of graphs. II, On the structure of factorizable graphs, Star-factors with large components, An extension of A.R. Rao's characterization of potentially \(K_{m+1}\)-graphic sequences, Stability Number and k-Hamiltonian [a, b-factors], Binding number and Hamiltonian (g, f)-factors in graphs II, Binding numbers and \([a,b\)-factors excluding a given \(k\)-factor], Research on fractional critical covered graphs, Stability number and \(f\)-factors in graphs, Indestructive deletions of edges from graphs, Simplified existence theorems on all fractional \([a,b\)-factors], Graph factors, A sufficient condition for a graph to have \([a,b\)-factors], Efficiently Realizing Interval Sequences, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On specific factors in graphs, Maximum \((g,f)\)-factors of a general graph, On some factor theorems of graphs, \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs, Balanced network flows. IV. Duality and structure theory, Binding number and Hamiltonian \((g,f)\)-factors in graphs, Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm, Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties, Unnamed Item, Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture, Factors in graphs with odd-cycle property, Orthogonal (g, f)-factorizations in networks, A new degree condition for graphs to have \([a,b\)-factor], On 2-edge-connected \([\mathbf{a,b}\)-factors of graphs with Ore-type condition], Matchings in graphs. II, Fan-type results for the existence of [\(a\),\(b\)-factors], Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors], Degree conditions for \(k\)-Hamiltonian \([a,b\)-factors], Constructive proof of deficiency theorem of \((g,f)\)-factor, Distributing vertices along a Hamiltonian cycle in Dirac graphs, An edge-coloration theorem for bipartite graphs with applications, Nontrivial path covers of graphs: existence, minimization and maximization, An extension of Tutte's 1-factor theorem, Simplified existence theorems for \((g,f)\)-factors, Toughness of graphs and the existence of factors, The stability number and connected \([k,k+1\)-factor in graphs], An existence theorem on Hamiltonian (g,f)-factors in networks, A simple existence criterion for \((g<f)\)-factors, Toughness and \([a, b\)-factors with inclusion\(/\)exclusion properties], Degree conditions for Hamiltonian graphs to have \([a,b\)-factors containing a given Hamiltonian cycle], Packing paths of length at least two, Linear-time certifying algorithms for near-graphical sequences, More sufficient conditions for a graph to have factors, \(k\)-regular factors and semi-\(k\)-regular factors in graphs, On \((g,f)\)-uniform graphs, \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs, Balanced matrices, Sufficient conditions for a graph to have factors, 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs, Randomly orthogonal \((g,f)\)-factorizations in graphs, Proof of a conjecture on the spectral radius condition for \([a,b\)-factors], Relaxed and approximate graph realizations, Cycles in complementary prisms, Factors of regular graphs
