Complexity of two coloring problems in cubic planar bipartite mixed graphs
DOI10.1016/J.DAM.2009.10.016zbMATH Open1226.05122OpenAlexW2093519478MaRDI QIDQ968180FDOQ968180
Authors: B. E. Eshmatov 
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/record/324396/files/coloringmixedgraphsiii.pdf
Recommendations
- On two coloring problems in mixed graphs
- Hard coloring problems in low degree planar bipartite graphs
- The complexity of some graph colouring problems
- Two complexity results for the vertex coloring problem
- Colouring planar mixed hypergraphs
- Mixed hypergraphs and other coloring problems
- On the complexity of bicoloring clique hypergraphs of graphs
- scientific article; zbMATH DE number 1839477
- Coloring mixed hypergraphs: theory, algorithms and applications
- Filling the complexity gaps for colouring planar and bounded degree graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Complexity of Scheduling under Precedence Constraints
- Title not available (Why is that?)
- Hard coloring problems in low degree planar bipartite graphs
- Mixed graph colorings
- On two coloring problems in mixed graphs
- Coloring some classes of mixed graphs
- Scheduling groups of tasks with precedence constraints on three dedicated processors.
- A note on mixed tree coloring
Cited In (5)
- Parameterized mixed graph coloring
- On two coloring problems in mixed graphs
- On the complexity of the selective graph coloring problem in some special classes of graphs
- Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs
- Biclique-colouring verification complexity and biclique-colouring power graphs
This page was built for publication: Complexity of two coloring problems in cubic planar bipartite mixed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968180)
