The following pages link to (Q4807727):
Displaying 17 items.
- Uniquely forced perfect matching and unique 3-edge-coloring (Q323081) (← links)
- Three-matching intersection conjecture for perfect matching polytopes of small dimensions (Q390921) (← links)
- Sparsely intersecting perfect matchings in cubic graphs (Q397063) (← links)
- Eulerian colorings and the bipartizing matchings conjecture of Fleischner (Q852699) (← links)
- Matchings in 3-vertex-critical graphs: the odd case (Q879342) (← links)
- Bipartizing matchings and Sabidussi's compatibility conjecture (Q1349078) (← links)
- Cuts in matchings of 3-connected cubic graphs (Q1633599) (← links)
- Cores, joins and the Fano-flow conjectures (Q1692639) (← links)
- On the maximum fraction of edges covered by \(t\) perfect matchings in a cubic bridgeless graph (Q2342641) (← links)
- Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching (Q2692777) (← links)
- On a conjecture of Fan and Raspaud (Q2851469) (← links)
- The Fan–Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks (Q2934517) (← links)
- On a family of cubic graphs containing the flower snarks (Q3059097) (← links)
- Mácajová and Škoviera conjecture on cubic graphs (Q3059098) (← links)
- An equivalent formulation of the Fan-Raspaud Conjecture and related problems (Q3298120) (← links)
- Non-intersecting perfect matchings in cubic graphs (Extended abstract) (Q3439597) (← links)
- Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs (Q5881007) (← links)
