Pages that link to "Item:Q5595084"
From MaRDI portal
The following pages link to Subgraphs with prescribed valencies (Q5595084):
Displayed 50 items.
- Toughness and \([a, b]\)-factors with inclusion\(/\)exclusion properties (Q763635) (← links)
- Sufficient conditions for a graph to have factors (Q803162) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- A characterization of graphs without even factors (Q882784) (← links)
- Constructive proof of deficiency theorem of \((g,f)\)-factor (Q989802) (← links)
- Distributing vertices along a Hamiltonian cycle in Dirac graphs (Q998458) (← links)
- The stability number and connected \([k,k+1]\)-factor in graphs (Q1023082) (← links)
- Linear-time certifying algorithms for near-graphical sequences (Q1045061) (← links)
- Factors of regular graphs (Q1074601) (← links)
- General factors of graphs (Q1085185) (← links)
- Biregular subgraphs of biregular graphs (Q1091405) (← links)
- Factors and induced subgraphs (Q1120595) (← links)
- \((g,f)\)-factorizations orthogonal to a subgraph of a graph (Q1128115) (← links)
- f-factors and related decompositions of graphs (Q1147717) (← links)
- On Petersen's graph theorem (Q1148334) (← links)
- Subgraphs and their degree sequences of a digraph (Q1148915) (← links)
- Indestructive deletions of edges from graphs (Q1164646) (← links)
- Graph factors (Q1168989) (← links)
- A sufficient condition for a graph to have \([a,b]\)-factors (Q1173656) (← links)
- Maximum \((g,f)\)-factors of a general graph (Q1179272) (← links)
- On some factor theorems of graphs (Q1185099) (← links)
- Factors in graphs with odd-cycle property (Q1210551) (← links)
- Matchings in graphs. II (Q1214950) (← links)
- An edge-coloration theorem for bipartite graphs with applications (Q1248526) (← links)
- An extension of Tutte's 1-factor theorem (Q1256496) (← links)
- Factors of trees (Q1331986) (← links)
- A characterization of graphs having all \((g,f)\)-factors (Q1366610) (← links)
- The membership problem in jump systems (Q1369649) (← links)
- \((g,f)\)-factorizations of graphs orthogonal to \([1,2]\)-subgraphs (Q1375339) (← links)
- More sufficient conditions for a graph to have factors (Q1584225) (← links)
- \(k\)-regular factors and semi-\(k\)-regular factors in graphs (Q1584278) (← links)
- Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties (Q1753364) (← links)
- A new degree condition for graphs to have \([a,b]\)-factor (Q1764908) (← links)
- Simplified existence theorems for \((g,f)\)-factors (Q1813711) (← links)
- Toughness of graphs and the existence of factors (Q1813740) (← links)
- Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle (Q1827685) (← links)
- Packing paths of length at least two (Q1827782) (← links)
- Randomly orthogonal \((g,f)\)-factorizations in graphs (Q1862827) (← links)
- Complete-factors and (\(g,f\))-factors (Q1874376) (← links)
- Orthogonal \((g,f)\)-factorizations in graphs (Q1897433) (← links)
- Sufficient conditions for graphs to have \((g,f)\)-factors (Q1916381) (← links)
- Orthogonal \([k-1,k+1]\)-factorizations in graphs (Q1918196) (← links)
- An extension of A.R. Rao's characterization of potentially \(K_{m+1}\)-graphic sequences (Q1949118) (← links)
- Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors (Q2023721) (← links)
- Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors (Q2025161) (← links)
- Proof of a conjecture on the spectral radius condition for \([a,b]\)-factors (Q2111929) (← links)
- Relaxed and approximate graph realizations (Q2115836) (← links)
- Decomposition of graphs with constraint on minimum degree (Q2172390) (← links)
- Research on fractional critical covered graphs (Q2211178) (← links)
- On specific factors in graphs (Q2227979) (← links)