Pages that link to "Item:Q2426450"
From MaRDI portal
The following pages link to On two coloring problems in mixed graphs (Q2426450):
Displaying 15 items.
- On weak chromatic polynomials of mixed graphs (Q489344) (← links)
- On weighted directed graphs (Q648928) (← links)
- Coloring some classes of mixed graphs (Q858294) (← links)
- Mixed hypergraphs and other coloring problems (Q868365) (← links)
- Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs (Q897592) (← links)
- Complexity of two coloring problems in cubic planar bipartite mixed graphs (Q968180) (← links)
- Mixed graph edge coloring (Q1043571) (← links)
- Mixed graph colorings (Q1360876) (← links)
- On clique numbers of colored mixed graphs (Q2097162) (← links)
- Parameterized mixed graph coloring (Q2424815) (← links)
- Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
- Routing equal-size messages on a slotted ring (Q2434298) (← links)
- Chromatic number of sparse colored mixed planar graphs (Q2851490) (← links)
- Lower bounds for the colored mixed chromatic number of some classes of graphs. (Q3568713) (← links)
- The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial (Q6045448) (← links)