The following pages link to Even circuits in planar graphs (Q1168333):
Displaying 20 items.
- On even cycle decompositions of 4-regular line graphs (Q383685) (← links)
- Even cycle decompositions of 4-regular graphs and line graphs (Q442390) (← links)
- Triangle-free circuit decompositions and Petersen minor (Q1272477) (← links)
- The construction and reduction of strong snarks (Q1356495) (← links)
- Circuit decompositions of Eulerian graphs (Q1569071) (← links)
- On circuit decomposition of planar Eulerian graphs (Q1814589) (← links)
- Even cycle decompositions of index 3 by a novel coloring technique (Q2142687) (← links)
- On 4-connected 4-regular graphs without even cycle decompositions (Q2144604) (← links)
- On even cycle decompositions of line graphs of cubic graphs (Q2182216) (← links)
- Even-cycle decompositions of graphs with no odd-\(K_4\)-minor (Q2400967) (← links)
- Even cycles and even 2-factors in the line graph of a simple graph (Q2411500) (← links)
- Strongly even cycle decomposable 4-regular line graphs (Q2662802) (← links)
- On the simultaneous edge coloring of graphs (Q2931912) (← links)
- Strongly Even-Cycle Decomposable Graphs (Q2958205) (← links)
- An Eulerian exposition (Q3204499) (← links)
- On even circuit decompositions of eulerian graphs (Q4277987) (← links)
- Smallest (1, 2)‐eulerian weight and shortest cycle covering (Q4284101) (← links)
- Graphs with the Circuit Cover Property (Q4305925) (← links)
- \(H\)-colorings for 4-regular graphs (Q6177438) (← links)
- Strongly even cycle decomposable non-planar line graphs (Q6204337) (← links)
