The complexity of signed graph and edge-coloured graph homomorphisms (Q2374178): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Richard C. Brewster / rank
Normal rank
 
Property / author
 
Property / author: Q790131 / rank
Normal rank
 
Property / author
 
Property / author: Richard C. Brewster / rank
 
Normal rank
Property / author
 
Property / author: Pavol Hell / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2200162493 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1510.05502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms of edge-colored graphs and Coxeter groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of colouring symmetric relational systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-switching homomorphisms of edge-coloured graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi‐arc graphs and the complexity of list homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of \(H\)-colouring of bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the notion of balance of a signed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nice graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms and oriented colorings of equivalence classes of oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(H\)-colouring planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms of 2-edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5747403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms of Signed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of signed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic invariants of signed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How colorful the signed graph? / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:51, 13 July 2024

scientific article
Language Label Description Also known as
English
The complexity of signed graph and edge-coloured graph homomorphisms
scientific article

    Statements

    The complexity of signed graph and edge-coloured graph homomorphisms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 December 2016
    0 references
    signed graph
    0 references
    edge-coloured graph
    0 references
    graph homomorphism
    0 references
    dichotomy theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references