Complexity of two coloring problems in cubic planar bipartite mixed graphs (Q968180): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093519478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard coloring problems in low degree planar bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on mixed tree coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed graph colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling under Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling groups of tasks with precedence constraints on three dedicated processors. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring some classes of mixed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two coloring problems in mixed graphs / rank
 
Normal rank

Latest revision as of 19:43, 2 July 2024

scientific article
Language Label Description Also known as
English
Complexity of two coloring problems in cubic planar bipartite mixed graphs
scientific article

    Statements

    Complexity of two coloring problems in cubic planar bipartite mixed graphs (English)
    0 references
    0 references
    5 May 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    mixed graph coloring
    0 references
    computational complexity
    0 references
    list coloring
    0 references
    bipartite graph
    0 references
    scheduling
    0 references
    0 references