Locally Injective Homomorphism to the Simple Weight Graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10102942" target="_blank" >RIV/00216208:11320/11:10102942 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-642-20877-5_46" target="_blank" >http://dx.doi.org/10.1007/978-3-642-20877-5_46</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-20877-5_46" target="_blank" >10.1007/978-3-642-20877-5_46</a>

Result language

angličtina

Original language name

Locally Injective Homomorphism to the Simple Weight Graphs

Original language description

A Weight graph is a connected (multi)graph with two vertices u and v of degree at least three and other vertices of degree two. Moreover, if any of these two vertices is removed, the remaining graph contains a cycle. A Weight graph is called simple if the degree of u and v is three. We show full computational complexity characterization of the problem of deciding the existence of a locally injective homomorphism from an input graph G to any fixed simple Weight graph by identifying some polynomial casesand some NP-complete cases.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2011

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Lecture Notes in Computer Science

ISSN

0302-9743

e-ISSN

—

Volume of the periodical

6648

Issue of the periodical within the volume

1

Country of publishing house

DE - GERMANY

Number of pages

12

Pages from-to

471-482

UT code for WoS article

—

EID of the result in the Scopus database

—