Complexity of planar signed graph homomorphisms to cycles (Q777377): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1907.03266 / 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: Homomorphism bounds of signed bipartite \(K_4\)-minor-free graphs and edge-colorings of \(2k\)-regular \(K_4\)-minor-free multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms from sparse graphs with large girth. / 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: The complexity of signed graph and edge-coloured graph homomorphisms / 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: A complexity dichotomy for signed \(\mathbf{H}\)-colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms of Signed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Dichotomy for the Coloring of Sparse Graphs / 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: High-girth graphs avoiding a minor are nearly bipartite / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / 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: Q3807237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / 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: Hypothetical complexity of the nowhere-zero 5-flow problem / 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: The star-chromatic number of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms and edge-colourings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5747403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth, subgraph coloring and homomorphism bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy for bounded degree \(H\)-colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical bibliography of signed and gain graphs and allied areas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of signed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic invariants of signed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How colorful the signed graph? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs with circular chromatic numbers between 3 and 4 / rank
 
Normal rank

Latest revision as of 02:06, 23 July 2024

scientific article
Language Label Description Also known as
English
Complexity of planar signed graph homomorphisms to cycles
scientific article

    Statements

    Complexity of planar signed graph homomorphisms to cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 July 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    signed graph
    0 references
    edge-coloured graph
    0 references
    graph homomorphism
    0 references
    planar graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references