Pages that link to "Item:Q2144321"
From MaRDI portal
The following pages link to Minimum maximal matchings in cubic graphs (Q2144321):
Displaying 11 items.
- Smallest cubic graphs with prescribed properties (Q801931) (← links)
- On disjoint matchings in cubic graphs (Q968438) (← links)
- A generalization of Petersen's matching theorem (Q2111920) (← links)
- On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs (Q2449123) (← links)
- Maximum Cardinality Simple 2-matchings in Subcubic Graphs (Q3105789) (← links)
- Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time (Q3401102) (← links)
- (Q3483302) (← links)
- Small maximal matchings of random cubic graphs (Q3652558) (← links)
- Maximum matchings in the \(n\)-dimensional cube (Q5951061) (← links)
- A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number (Q6055403) (← links)
- Connected cubic graphs with the maximum number of perfect matchings (Q6057662) (← links)