Coloring some classes of mixed graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1594564 (Why is no real title available?)
- scientific article; zbMATH DE number 1731177 (Why is no real title available?)
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3545685 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 512918 (Why is no real title available?)
- scientific article; zbMATH DE number 772747 (Why is no real title available?)
- scientific article; zbMATH DE number 772760 (Why is no real title available?)
- Mixed graph colorings
- Scheduling Problems and Mixed Graph Colorings
Cited in
(11)- The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial
- Parameterized mixed graph coloring
- Mixed hypergraphs and other coloring problems
- Complexity of two coloring problems in cubic planar bipartite mixed graphs
- Mixed graph edge coloring
- Mixing 3-Colourings in Bipartite Graphs
- Vyacheslav Tanaev: contributions to scheduling and related areas
- On two coloring problems in mixed graphs
- A note on mixed tree coloring
- On networks with order close to the Moore bound
- Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians
This page was built for publication: Coloring some classes of mixed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858294)