Exact algorithm for graph homomorphism and locally injective graph homomorphism (Q2446599): 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: 1310.3341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474120 / 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: Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of partial covers of theta graphs / 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: Exact algorithms for graph homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for \(L(2,1)\)-labeling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast exact algorithm for \(L(2,1)\)-labeling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number: A survey / rank
 
Normal rank

Latest revision as of 10:53, 8 July 2024

scientific article
Language Label Description Also known as
English
Exact algorithm for graph homomorphism and locally injective graph homomorphism
scientific article

    Statements

    Exact algorithm for graph homomorphism and locally injective graph homomorphism (English)
    0 references
    17 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    graph homomorphism
    0 references
    locally injective homomorphism
    0 references
    \(H(2, 1)\)-labeling
    0 references
    exact algorithm
    0 references
    0 references
    0 references
    0 references
    0 references