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 35 items.
- Star-cycle factors of graphs (Q2442276) (← links)
- On the signed star domination number of regular multigraphs (Q2453816) (← links)
- Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs (Q2515567) (← links)
- Strong \(f\)-star factors of graphs (Q2516674) (← links)
- Cut-edges and regular factors in regular graphs of odd degree (Q2657077) (← links)
- Even factors in edge-chromatic-critical graphs with a small number of divalent vertices (Q2670691) (← links)
- Edge decompositions and rooted packings of graphs (Q2675822) (← links)
- Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs (Q2675828) (← links)
- Eigenvalues and parity factors in graphs with given minimum degree (Q2685325) (← links)
- On 1-sum flows in undirected graphs (Q2834760) (← links)
- On Cui-Kano's characterization problem on graph factors (Q2862548) (← links)
- Degree Conditions for Spanning Brooms (Q2930040) (← links)
- Partitioning a Graph into Highly Connected Subgraphs (Q3188667) (← links)
- An Extension of Cui-Kano's Characterization on Graph Factors (Q3466349) (← links)
- Improved queue-size scaling for input-queued switches via graph factorization (Q5005035) (← links)
- Spanning k-ended trees of 3-regular connected graphs (Q5006619) (← links)
- Total colorings of circulant graphs (Q5025120) (← links)
- The number of disjoint perfect matchings in semi-regular graphs (Q5034273) (← links)
- Maximum and optimal 1-2 matching problem of the different kind (Q5035028) (← links)
- TWO RESULTS ON THE PALETTE INDEX OF GRAPHS (Q5100173) (← links)
- Spanning trees with small diameters (Q5154596) (← links)
- Star decomposition of graphs (Q5261050) (← links)
- A Tutte-Type Characterization for Graph Factors (Q5267996) (← links)
- \((1,f)\)-factors of graphs with odd property (Q5964978) (← links)
- Factors with red-blue coloring of claw-free graphs and cubic graphs (Q6166670) (← links)
- Pairwise Disjoint Perfect Matchings in <i>r</i>-Edge-Connected <i>r</i>-Regular Graphs (Q6170446) (← links)
- Matching extension and matching exclusion via the size or the spectral radius of graphs (Q6202947) (← links)
- Path factors in bipartite graphs from size or spectral radius (Q6614061) (← links)
- Tight toughness bounds for path-factor critical avoidable graphs (Q6643349) (← links)
- Distance spectral radius and fractional matching in <i>t</i> -connected graphs (Q6655455) (← links)
- Star-factors with large components, fractional \(k\)-extendability and spectral radius in graphs (Q6657244) (← links)
- Fractional factors and component factors in graphs with isolated toughness smaller than 1 (Q6657593) (← links)
- On graph-based network parameters and component factors in networks (Q6658448) (← links)
- Component factors and degree sum conditions in graphs (Q6658862) (← links)
- Degree sum conditions for path-factor uniform graphs (Q6669307) (← links)
