Computational complexity of covering three-vertex multigraphs (Q897866): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.09.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1954345120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for constraint satisfaction problems on a 3-element set / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverings and minors: Application to local computations in 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: Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally constrained graph homomorphisms -- structure, complexity, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: K4,4 ?e has no finite planar cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On possible counterexamples to Negami's planar cover conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4373685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3831029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank

Latest revision as of 04:45, 11 July 2024

scientific article
Language Label Description Also known as
English
Computational complexity of covering three-vertex multigraphs
scientific article

    Statements

    Computational complexity of covering three-vertex multigraphs (English)
    0 references
    0 references
    0 references
    0 references
    8 December 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    graph homomorphism
    0 references
    covering projection
    0 references
    0 references