On the complexity of role colouring planar graphs, trees and cographs (Q891815): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963336224 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1408.5412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular equivalence: General theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Role colouring a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Universal Covers in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete complexity classification of the role assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4237089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How hard is it to determine if a graph has a 2-role assignment? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-role assignments on triangulated graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing role assignments of chordal graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:54, 11 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of role colouring planar graphs, trees and cographs
scientific article

    Statements

    On the complexity of role colouring planar graphs, trees and cographs (English)
    0 references
    0 references
    0 references
    17 November 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    role colouring
    0 references
    regular equivalence
    0 references
    locally surjective homomorphism
    0 references
    complexity
    0 references
    planar graph
    0 references
    tree
    0 references
    cograph
    0 references
    0 references
    0 references