Pages that link to "Item:Q968180"
From MaRDI portal
The following pages link to Complexity of two coloring problems in cubic planar bipartite mixed graphs (Q968180):
Displaying 5 items.
- Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
- Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs (Q897592) (← links)
- Parameterized mixed graph coloring (Q2424815) (← links)
- On two coloring problems in mixed graphs (Q2426450) (← links)
- On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)