Pages that link to "Item:Q2692777"
From MaRDI portal
The following pages link to Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching (Q2692777):
Displaying 7 items.
- Bipartizing matchings and Sabidussi's compatibility conjecture (Q1349078) (← links)
- Mácajová and Škoviera conjecture on cubic graphs (Q3059098) (← links)
- An equivalent formulation of the Fan-Raspaud Conjecture and related problems (Q3298120) (← links)
- On the existence of graphs which can colour every regular graph (Q6162043) (← links)
- Pairwise Disjoint Perfect Matchings in <i>r</i>-Edge-Connected <i>r</i>-Regular Graphs (Q6170446) (← links)
- \(H\)-colorings for 4-regular graphs (Q6177438) (← links)
- Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching (Q6397067) (← links)
