Pages that link to "Item:Q2040017"
From MaRDI portal
The following pages link to Cubic graphs that cannot be covered with four perfect matchings (Q2040017):
Displaying 7 items.
- On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings (Q2922223) (← links)
- On a family of cubic graphs containing the flower snarks (Q3059097) (← links)
- On Perfect Matching Coverings and Even Subgraph Coverings (Q3466356) (← links)
- The extremal average distance of cubic graphs (Q6047959) (← 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)