The following pages link to Coloring edges of embedded graphs (Q4521489):
Displaying 18 items.
- On edge colorings of 1-toroidal graphs (Q353624) (← links)
- Complexity issues in color-preserving graph embeddings (Q846361) (← links)
- Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\) (Q933675) (← links)
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces (Q998357) (← links)
- The edge-face coloring of graphs embedded in a surface of characteristic zero (Q1025544) (← links)
- Mixed graph edge coloring (Q1043571) (← links)
- Edge coloring of graphs with small maximum degrees (Q1044957) (← links)
- Embedding finite graphs into graphs colored with infinitely many colors (Q1182823) (← links)
- Coloring edges of graphs embedded in a surface of characteristic zero. (Q1405117) (← links)
- An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree (Q1408892) (← links)
- Edge colorings of embedded graphs (Q1576578) (← links)
- On simultaneous colorings of embedded graphs (Q1586769) (← links)
- Parsimonious edge coloring (Q1910535) (← links)
- Simultaneous embedding of colored graphs (Q2045370) (← links)
- Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\) (Q2409528) (← links)
- Edge colourings of embedded 1-graphs (Q2823372) (← links)
- Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles (Q3066941) (← links)
- Parsimonious edge-coloring on surfaces (Q5009990) (← links)
