The following pages link to Eckhard Steffen (Q311517):
Displaying 9 items.
- Highly edge‐connected regular graphs without large factorizable subgraphs (Q6056797) (← links)
- Edge colorings and circular flows on regular graphs (Q6057647) (← links)
- Symmetric set coloring of signed graphs (Q6114964) (← links)
- Bounds for the chromatic index of signed multigraphs (Q6162038) (← links)
- Pairwise Disjoint Perfect Matchings in <i>r</i>-Edge-Connected <i>r</i>-Regular Graphs (Q6170446) (← links)
- The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree (Q6172314) (← links)
- Rotation $r$-graphs (Q6434241) (← links)
- Edge-connectivity and pairwise disjoint perfect matchings in regular graphs (Q6506498) (← links)
- Rotation $r$-graphs (Q6509807) (← links)
