The following pages link to (Q4294635):
Displaying 15 items.
- Computational results and new bounds for the circular flow number of snarks (Q785826) (← links)
- Classification and characterizations of snarks (Q1584327) (← links)
- Superposition and constructions of graphs without nowhere-zero \(k\)-flows (Q1612758) (← links)
- Asymptotic lower bounds on circular chromatic index of snarks (Q1953476) (← links)
- Berge-Fulkerson coloring for some families of superposition snarks (Q2033883) (← links)
- Superposition of snarks revisited (Q2225424) (← links)
- Even cycles and even 2-factors in the line graph of a simple graph (Q2411500) (← links)
- Fulkerson's conjecture and Loupekine snarks (Q2449149) (← links)
- Berge-Fulkerson conjecture on certain snarks (Q2516508) (← links)
- On Coloring Problems of Snark Families (Q2840681) (← links)
- The Fan–Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks (Q2934517) (← links)
- The <i>k</i>-conversion number of regular graphs (Q4956206) (← links)
- Rotationally symmetric snarks from voltage graphs (Q6197742) (← links)
- Perfect pseudo-matchings in cubic graphs (Q6640960) (← links)
- On the pebbling numbers of flower, Blanuša and Watkins snarks (Q6657240) (← links)
