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