Partial covers of graphs

@article{Fiala2002PartialCO,
  title={Partial covers of graphs},
  author={J. Fiala and J. Kratochv{\'i}l},
  journal={Discuss. Math. Graph Theory},
  year={2002},
  volume={22},
  pages={89-99}
}
  • J. Fiala, J. Kratochvíl
  • Published 2002
  • Mathematics, Computer Science
  • Discuss. Math. Graph Theory
  • Given graphs G and H, a mapping f : V (G) → V (H) is a homomorphism if (f(u), f(v)) is an edge of H for every edge (u, v) of G. In this paper, we initiate the study of computational complexity of locally injective homomorphisms called partial covers of graphs. We motivate the study of partial covers by showing a correspondence to generalized (2,1)-colorings of graphs, the notion stemming from a practical problem of assigning frequencies to transmitters without interference. We compare the… CONTINUE READING
    54 Citations
    Complexity of Partial Covers of Graphs
    • 36
    Generalized H-coloring and H-covering of Trees
    • 11
    • PDF
    Locally Injective Homomorphism to the Simple Weight Graphs
    • 2
    • PDF
    Distance Constrained Labelings of Trees
    • 11
    • PDF
    Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
    • 4
    • PDF
    Complexity of locally-injective homomorphisms to tournaments
    The complexity of locally injective homomorphisms
    • 6
    • PDF
    The Computational Complexity of the Role Assignment Problem
    • 25
    • PDF

    References

    SHOWING 1-10 OF 34 REFERENCES
    Complexity of Partial Covers of Graphs
    • 36
    On the Complexity of Graph Covering Problems
    • 39
    Covering Regular Graphs
    • 53
    • PDF
    On the complexity of H-coloring
    • 685
    • PDF
    The core of a graph
    • 216
    Finite common coverings of graphs
    • F. Leighton
    • Mathematics, Computer Science
    • J. Comb. Theory, Ser. B
    • 1982
    • 101
    The complexity of counting graph homomorphisms
    • 174
    • PDF
    Labelling Graphs with a Condition at Distance 2
    • 630
    • PDF
    Fixed-parameter complexity of lambda-labelings
    • 90
    Generating all graph coverings by permutation voltage assignments
    • 224