Explicit homomorphisms of hexagonal graphs to one vertex deleted Petersen graph

Mathematical Communications

Žerovnik, Janez¹  Šparl, Petra² 

[1] Faculty of Mechanical Engineering, University of Ljubljana, Ljubljana, Slovenia;Faculty of Organizational Sciences, University of Maribor, Kranj, Slovenia

关键词: homomorphism;    H-coloring;    triangle-free hexagonal graph;   

DOI  :  

学科分类：社会科学、人文和艺术（综合）

来源: Sveuciliste Josipa Jurja Strossmayera u Osijeku * Odjel za Matematiku / University of Osijek, Department of Mathematics

【 摘 要 】

TheproblemofdecidingwhetheranarbitrarygraphGhasahomomorphismintoagivengraphHhasbeenwidelystudiedandhasturnedouttobeverydifficult.HellandNešetrilprovedthatthedecisionproblemisNP-completeunlessHis...

【 授权许可】

Unknown