Pages that link to "Item:Q5826303"
From MaRDI portal
The following pages link to A Short Proof of the Factor Theorem for Finite Graphs (Q5826303):
Displaying 50 items.
- Approximating bounded-degree spanning trees and connected factors with leaves (Q1728165) (← links)
- Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
- Spanning subgraphs with specified valencies (Q1844690) (← links)
- Finding paths in graphs avoiding forbidden transitions (Q1861577) (← links)
- At most \(k\)-to-1 mappings between graphs. II (Q1918542) (← links)
- Negative examples for sequential importance sampling of binary contingency tables (Q1945173) (← links)
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs (Q1949271) (← links)
- Navigating between packings of graphic sequences (Q2026343) (← links)
- An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem (Q2076286) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search (Q2230729) (← links)
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
- Realization of a sum of sequences by a sum graph (Q2264777) (← links)
- A factorization theorem for a certain class of graphs (Q2264778) (← links)
- A complexity and approximation framework for the maximization scaffolding problem (Q2354768) (← links)
- Cycles in complementary prisms (Q2355749) (← links)
- Graph realizations constrained by skeleton graphs (Q2363110) (← links)
- On the complexity landscape of connected \(f\)-factor problems (Q2414869) (← links)
- Vizing's 2-factor conjecture involving toughness and maximum degree conditions (Q2415079) (← links)
- An algorithmic approach to dual integrality of matching and extensions (Q2419581) (← links)
- On the threshold for \(k\)-regular subgraphs of random graphs (Q2428631) (← links)
- Tough graphs and Hamiltonian circuits. (Reprint) (Q2497990) (← links)
- Spanning subgraphs with specified valencies. (Reprint) (Q2497993) (← links)
- Finding maximum square-free 2-matchings in bipartite graphs (Q2498740) (← links)
- Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications (Q2514145) (← links)
- On Hamilton's ideals (Q2545100) (← links)
- Tough graphs and Hamiltonian circuits. (Q2558871) (← links)
- Maximal-\(\Gamma\)-prime Graphen (Q2625678) (← links)
- Cut-edges and regular factors in regular graphs of odd degree (Q2657077) (← links)
- Disjoint stable matchings in linear time (Q2672428) (← links)
- Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
- The Stable Fixtures Problem with Payments (Q2827801) (← links)
- (1,2)-Hamiltonian completion on a matching (Q2841988) (← links)
- A note concerning graphs with unique f-factors (Q3033796) (← links)
- Approximation and Exact Algorithms for Special Cases of Connected f-Factors (Q3194728) (← links)
- Graphs and Subgraphs (Q3241661) (← links)
- Factors of Inserted Graphs (Q3429757) (← links)
- Generalized Hypergraph Matching via Iterated Packing and Local Ratio (Q3453296) (← links)
- On the Number of α-Orientations (Q3508567) (← links)
- Intelligent Solutions for Curve Reconstruction Problem (Q3628364) (← links)
- Factors and factorizations of graphs—a survey (Q3714113) (← links)
- Regular factors of regular graphs (Q3752417) (← links)
- (Q3875973) (← links)
- Remarks on regular factors of regular graphs (Q4068761) (← links)
- Independent edges in bipartite graphs obtained from orientations of graphs (Q4304256) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- Independence number, connectivity, and r‐factors (Q4731218) (← links)
- On the Swap-Distances of Different Realizations of a Graphical Degree Sequence (Q4921567) (← links)
- On the necessity of Chvátal’s Hamiltonian degree condition (Q5012357) (← links)
- On graphs admitting two disjoint maximum independent sets (Q5058163) (← links)
