Pages that link to "Item:Q547467"
From MaRDI portal
The following pages link to Factors and factorizations of graphs. Proof techniques in factor theory (Q547467):
Displaying 50 items.
- Spanning trees with bounded degrees and leaves (Q271638) (← links)
- Decomposing highly edge-connected graphs into paths of any given length (Q345101) (← links)
- Spanning \(k\)-ended trees of bipartite graphs (Q394291) (← links)
- Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs (Q394360) (← links)
- Extensions to 2-factors in bipartite graphs (Q396808) (← links)
- \(m\)-dominating \(k\)-ended trees of graphs (Q400391) (← links)
- Star-factors with large components (Q427856) (← links)
- Spanning \(k\)-trees of bipartite graphs (Q490315) (← links)
- Generalizations of marriage theorem for degree factors (Q503622) (← links)
- Affine-invariant strictly cyclic Steiner quadruple systems (Q517265) (← links)
- Graphs with integer matching polynomial zeros (Q526810) (← links)
- Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
- Spanning trees whose stems are spiders (Q897247) (← links)
- On affine-invariant two-fold quadruple systems (Q897251) (← links)
- \(m\)-dominating \(k\)-trees of graphs (Q898133) (← links)
- On some factor theorems of graphs (Q1185099) (← links)
- A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs (Q1617028) (← links)
- Greedy cycles in the star graphs (Q1669899) (← links)
- On vertex-parity edge-colorings (Q1702821) (← links)
- Decomposing highly connected graphs into paths of length five (Q1752489) (← links)
- The large level limit of Kazama-Suzuki models (Q1755103) (← links)
- Perfect matchings and \(K_{1,p}\)-restricted graphs (Q1996835) (← links)
- An extension of the Win theorem: counting the number of maximum independent sets (Q2002161) (← links)
- Rainbow and properly colored spanning trees in edge-colored bipartite graphs (Q2051897) (← links)
- Lower bounds on matching energy of graphs (Q2057601) (← links)
- Induced star-triangle factors of graphs (Q2062501) (← links)
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues (Q2066004) (← links)
- Factors of bi-regular bipartite graphs (Q2081492) (← links)
- Connected \(k\)-factors in bipartite graphs (Q2092400) (← links)
- Vizing's and Shannon's theorems for defective edge colouring (Q2094863) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Regular colorings in regular graphs (Q2175238) (← links)
- Projective normality of torus quotients of flag varieties (Q2176098) (← links)
- Characterization of 1-tough graphs using factors (Q2185904) (← links)
- Circular zero-sum \(r\)-flows of regular graphs (Q2191265) (← links)
- Existence of all generalized fractional \((g, f)\)-factors of graphs (Q2192082) (← links)
- Strong Tutte type conditions and factors of graphs (Q2194531) (← links)
- On caterpillar factors in graphs (Q2210502) (← links)
- Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs (Q2227834) (← links)
- On specific factors in graphs (Q2227979) (← links)
- The Turán number for the edge blow-up of trees (Q2231738) (← links)
- Fractional factors, component factors and isolated vertex conditions in graphs (Q2278109) (← links)
- Nowhere-zero flows on signed regular graphs (Q2346576) (← links)
- Star-like factors with large components (Q2356348) (← links)
- On double-star decomposition of graphs (Q2364102) (← links)
- On line graphs of subcubic triangle-free graphs (Q2400553) (← links)
- Colorful edge decomposition of graphs: some polynomial cases (Q2403802) (← links)
- The existence of \(P_{\geq3}\)-factor covered graphs (Q2409795) (← links)
- On 2-factors with a bounded number of odd components (Q2439124) (← links)
- Stability number and \(f\)-factors in graphs (Q2441358) (← links)
