The following pages link to (Q3115603):
Displaying 14 items.
- The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
- Total colorings of graphs with minimum sum of colors (Q503645) (← links)
- Error graphs and the reconstruction of elements in groups (Q1024341) (← links)
- On the chromatic number of a graph with two forbidden subgraphs (Q1122586) (← links)
- Chromatic numbers of infinite graphs (Q1212469) (← links)
- Partitioning the edges of a graph (Q1259608) (← links)
- Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings (Q1305535) (← links)
- Simultaneous coloring of edges and faces of plane graphs (Q1322167) (← links)
- Simultaneously colouring the edges and faces of plane graphs (Q1354728) (← links)
- List edge and list total colourings of multigraphs (Q1366604) (← links)
- Parallel adaptive mesh refinement and redistribution on distributed memory computers (Q1913184) (← links)
- Total chromatic sum for trees (Q2056882) (← links)
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree (Q2370454) (← links)
- Multicoloring the incidentors of a weighted directed multigraph (Q5264749) (← links)
