The following pages link to Eckhard Steffen (Q311517):
Displaying 50 items.
- Face-degree bounds for planar critical graphs (Q311518) (← links)
- Nowhere-zero 5-flows (Q322188) (← links)
- Nearly nowhere-zero \(r\)-flow graphs (Q449109) (← links)
- Intersecting 1-factors and nowhere-zero 5-flows (Q519996) (← links)
- Measures of edge-uncolorability (Q658079) (← links)
- On a theorem of Hans Läuchli (Q679674) (← links)
- Choosability in signed planar graphs (Q896077) (← links)
- Remarks on planar edge-chromatic critical graphs (Q906449) (← links)
- Chromatic-index-critical graphs of orders 11 and 12 (Q1277310) (← links)
- Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs (Q1356437) (← links)
- 3- and 4-critical graphs of small even order (Q1357738) (← links)
- Classification and characterizations of snarks (Q1584327) (← links)
- Flows in signed graphs with two negative edges (Q1640214) (← links)
- Cores, joins and the Fano-flow conjectures (Q1692639) (← links)
- \(c\)-planarity of embedded cyclic \(c\)-graphs (Q1693313) (← links)
- (Q1817584) (redirect page) (← links)
- Counterexamples to a conjecture about Petersen-minors in supersnarks (Q1817585) (← links)
- Measurements of edge-uncolorability (Q1827679) (← links)
- Non-bicritical critical snarks (Q1961764) (← links)
- Reduction of symmetric configurations \(n_3\) (Q1962060) (← links)
- A refinement of Vizing's theorem (Q1978167) (← links)
- Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable (Q2021579) (← links)
- Facial visibility in edge colored plane graphs (Q2062889) (← links)
- Frustration-critical signed graphs (Q2081482) (← links)
- Maximum bisections of graphs without cycles of length 4 (Q2142653) (← links)
- On \(d\)-panconnected tournaments with large semidegrees (Q2142665) (← links)
- Unions of 1-factors in \(r\)-graphs and overfull graphs (Q2188740) (← links)
- Chromatic numbers of some distance graphs (Q2191956) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- Spanning trees with few peripheral branch vertices (Q2233620) (← links)
- DP-degree colorable hypergraphs (Q2333798) (← links)
- Nowhere-zero flows on signed regular graphs (Q2346576) (← links)
- The difference between the circular and the integer flow number of bidirected graphs (Q2407020) (← links)
- Star chromatic numbers of graphs (Q2563519) (← links)
- The chromatic spectrum of signed graphs (Q2629274) (← links)
- Edge-disjoint paths in faulty augmented cubes (Q2656959) (← links)
- Fractional matchings, component-factors and edge-chromatic critical graphs (Q2657106) (← links)
- Even factors in edge-chromatic-critical graphs with a small number of divalent vertices (Q2670691) (← links)
- Circular flow numbers of regular multigraphs (Q2708793) (← links)
- (Q2713660) (← links)
- Maximum Δ-edge-colorable subgraphs of class II graphs (Q2911495) (← links)
- Petersen Cores and the Oddness of Cubic Graphs (Q2958201) (← links)
- Petersen-colorings and some families of snarks (Q3191455) (← links)
- Circular coloring of signed graphs (Q4604021) (← links)
- 1‐Factor and Cycle Covers of Cubic Graphs (Q4982281) (← links)
- Edge Colorings and Circular Flow Numbers of Regular Graphs (Q5251196) (← links)
- Nowhere‐Zero 5‐Flows On Cubic Graphs with Oddness 4 (Q5272921) (← links)
- The Set of Circular Flow Numbers of Regular Graphs (Q5495888) (← links)
- Relating embedding and coloring properties of snarks (Q5502848) (← links)
- Algorithms for the genome median under a restricted measure of rearrangement (Q6050572) (← links)
