Subgraphs with prescribed valencies

Cited In (only showing first 100 items - show all)

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

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)