Pages that link to "Item:Q4997131"
From MaRDI portal
The following pages link to Perfect Matching Index versus Circular Flow Number of a Cubic Graph (Q4997131):
Displayed 4 items.
- Cubic graphs that cannot be covered with four perfect matchings (Q2040017) (← links)
- Ban–Linial's Conjecture and treelike snarks (Q6057640) (← links)
- Deciding whether four perfect matchings can cover the edges of a snark is NP-complete (Q6150678) (← links)
- Some snarks are worse than others (Q6181999) (← links)