Coloring some classes of mixed graphs
From MaRDI portal
Publication:858294
DOI10.1016/J.DAM.2006.05.004zbMATH Open1108.05043OpenAlexW2009286174MaRDI QIDQ858294FDOQ858294
Authors: N. E. Zubov 
Publication date: 9 January 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/record/324397/files/coloringmixedgraphsi.pdf
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mixed graph colorings
- Scheduling Problems and Mixed Graph Colorings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- Parameterized mixed graph coloring
- A note on mixed tree coloring
- Mixing 3-Colourings in Bipartite Graphs
- On two coloring problems in mixed graphs
- The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial
- Mixed hypergraphs and other coloring problems
- On networks with order close to the Moore bound
- Complexity of two coloring problems in cubic planar bipartite mixed graphs
- Mixed graph edge coloring
- Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians
- Vyacheslav Tanaev: contributions to scheduling and related areas
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)
