Subgraphs with prescribed valencies

Cited in

(only showing first 100 items - show all)

The stability number and connected \([k,k+1]\)-factor in graphs
Linear-time certifying algorithms for near-graphical sequences
Factors of regular graphs
General factors of graphs
Biregular subgraphs of biregular graphs
Factors and induced subgraphs
\((g,f)\)-factorizations orthogonal to a subgraph of a graph
f-factors and related decompositions of graphs
On Petersen's graph theorem
Subgraphs and their degree sequences of a digraph
Indestructive deletions of edges from graphs
Graph factors
A sufficient condition for a graph to have \([a,b]\)-factors
Maximum \((g,f)\)-factors of a general graph
On some factor theorems of graphs
Factors in graphs with odd-cycle property
Matchings in graphs. II
An edge-coloration theorem for bipartite graphs with applications
An extension of Tutte's 1-factor theorem
Factors of trees
A characterization of graphs having all (g,f)-factors
The membership problem in jump systems
\((g,f)\)-factorizations of graphs orthogonal to \([1,2]\)-subgraphs
More sufficient conditions for a graph to have factors
\(k\)-regular factors and semi-\(k\)-regular factors in graphs
Some existence theorems on all fractional (g,f)-factors with prescribed properties
A new degree condition for graphs to have \([a,b]\)-factor
Simplified existence theorems for \((g,f)\)-factors
Toughness of graphs and the existence of factors
Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle
Packing paths of length at least two
Randomly orthogonal (g,f)-factorizations in graphs
Complete-factors and (\(g,f\))-factors
Orthogonal \((g,f)\)-factorizations in graphs
Sufficient conditions for graphs to have (g,f)-factors
Orthogonal \([k-1,k+1]\)-factorizations in graphs
An extension of A.R. Rao's characterization of potentially \(K_{m+1}\)-graphic sequences
Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors
Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
Proof of a conjecture on the spectral radius condition for \([a,b]\)-factors
Relaxed and approximate graph realizations
Decomposition of graphs with constraint on minimum degree
Research on fractional critical covered graphs
On specific factors in graphs
Nontrivial path covers of graphs: existence, minimization and maximization
Cycles in complementary prisms
A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs
Gadget classification
Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle
Randomly orthogonal factorizations in networks
Stability number and f-factors in graphs
Simplified existence theorems on all fractional \([a,b]\)-factors
(r,r+1)-factorizations of (d,d+1)-graphs
Binding number and Hamiltonian (g,f)-factors in graphs
On 2-edge-connected \([\mathbf{a,b}]\)-factors of graphs with Ore-type condition
Fan-type results for the existence of [\(a\),\(b\)]-factors
On \((g,f)\)-uniform graphs
\((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs
Complexity of a disjoint matching problem on bipartite graphs
Fractional matchings, component-factors and edge-chromatic critical graphs
On degree sequence optimization
Optimization over degree sequences of graphs
Eigenvalues and parity factors in graphs with given minimum degree
Balanced network flows. IV: Duality and structure theory.
Stability number and \(k\)-Hamiltonian \([a,b]\)-factors
Binding number, minimum degree and \((g,f)\)-factors of graphs
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Antifactors of regular bipartite graphs
An existence theorem on fractional deleted graphs
Binding number and Hamiltonian (g, f)-factors in graphs II
Sufficient condition for the existence of an even \([a,b]\)-factor in graph
Packings by Complete Bipartite Graphs
scientific article; zbMATH DE number 3679881 (Why is no real title available?)
Regular factors and eigenvalues of regular graphs
Constructive extensions of two results on graphic sequences
Star-factors with large components
Orthogonal (g, f)-factorizations in networks
Stability number and [a,b]‐factors in graphs
AN ORE-TYPE CONDITION FOR THE EXISTENCE OF EVEN [a,b]-FACTORS IN GRAPHS
Efficiently realizing interval sequences
An existence theorem on Hamiltonian (g,f)-factors in networks
Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
Some sufficient conditions for graphs to have (g, f)-factors
Some Results on Fractional Graph Theory
Balanced matrices
The factorization of graphs. II
On the structure of factorizable graphs
On the structure of factorizable graphs. II
Orthogonal factorizations of graphs
[a,b]-factors of graphs
A generalization of orthogonal factorizations in graphs
A \([k,k+1]\)-factor containing a given Hamiltonian cycle
Induced graph packing problems
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
General fractional \(f\)-factor numbers of graphs
Degree factors with red-blue coloring of regular graphs

This page was built for publication: Subgraphs with prescribed valencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5595084)