A GRAPH THEORETIC PROOF OF THE COMPLEXITY OF COLOURING BY A LOCAL TOURNAMENT WITH AT LEAST TWO DIRECTED CYCLES

被引：0

作者：

Bang-Jensen, Jorgen ^{[1
]}

MacGillivray, Gary ^{[2
]}

Swarts, Jacobus ^{[3
]}

机构：

[1] Univ Southern Denmark, Dept Math & Comp Sci, DK-5230 Odense M, Denmark

[2] Univ Victoria, Victoria, BC V8W 3R4, Canada

[3] Vancouver Isl Univ, Dept Math, Nanaimo, BC V9R 5S5, Canada

来源：

CONTRIBUTIONS TO DISCRETE MATHEMATICS | 2011年 / 6卷 / 02期

关键词：

Homomorphism; local tournament; NP-completeness; H-colouring;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this paper we give a graph theoretic proof of the fact that deciding whether a homomorphism exists to a fixed local tournament with at least two directed cycles is NP-complete. One of the main reasons for the graph theoretic proof is that it showcases all of the techniques that have been built up over the years in the study of the digraph homomorphism problem.

引用

页码：101 / 141

页数：41

共 8 条

[1] Partition of a directed bipartite graph into two directed cycles
Discrete Math, 1-3 (283):
[2] Partition of a directed bipartite graph into two directed cycles
Department of Mathematics, University of New Orleans, New Orleans, LA 70148, United States
不详
Discrete Math, 1-3 (283-289):
[3] Partition of a directed bipartite graph into two directed cycles
Wang, H
Little, C
Teo, K
DISCRETE MATHEMATICS, 1996, 160 (1-3) : 283 - 289
[4] Length of Longest Cycles in a Graph Whose Relative Length is at Least Two
Kenta Ozeki
Tomoki Yamashita
Graphs and Combinatorics, 2012, 28 : 859 - 868
[5] Length of Longest Cycles in a Graph Whose Relative Length is at Least Two
Ozeki, Kenta
Yamashita, Tomoki
GRAPHS AND COMBINATORICS, 2012, 28 (06) : 859 - 868
[6] Short cycles in digraphs with local average outdegree at least two
Shen, J
ELECTRONIC JOURNAL OF COMBINATORICS, 2003, 10 (01):
[7] Symmetric graph-theoretic roles of two-pairs and chords of cycles
McKee, Terry A.
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2014, 6 (03)
[8] LOGIC VS COMPLEXITY THEORETIC PROPERTIES OF THE GRAPH ACCESSIBILITY PROBLEM FOR DIRECTED-GRAPHS OF BOUNDED DEGREE
MEINEL, C
INFORMATION PROCESSING LETTERS, 1990, 34 (03) : 143 - 146

← 1 →