Complexity dichotomy for oriented homomorphism of planar graphs with large girth

被引：4

作者：

Guegan, Guillaume ^{[1
]}

Ochem, Pascal ^{[1
]}

机构：

[1] CNRS, LIRMM, Montpellier, France

来源：

THEORETICAL COMPUTER SCIENCE | 2015年 / 596卷

关键词：

Oriented homomorphism; Planar; NP-completeness; COLORINGS;

D O I：

10.1016/j.tcs.2015.06.041

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We consider the complexity of oriented homomorphism and two of its variants, namely strong oriented homomorphism and pushable homomorphism, for planar graphs with large girth. In each case, we consider the smallest target graph such that the corresponding homomorphism is NP-complete. These target graphs T-4, T-5, and T-6 have 4, 5, and 6 vertices, respectively. For i is an element of {4, 5, 6} and for every g, we prove that if there exists a (bipartite) planar oriented graph with girth at least g that does not map to T-i, then deciding homomorphism to T-i is NP-complete for (bipartite) planar oriented graphs with girth at least g. (C) 2015 Elsevier B.V. All rights reserved.

引用

页码：142 / 148

页数：7

共 50 条

[21] Infinite highly connected planar graphs of large girth
Georgakopoulos, A.
ABHANDLUNGEN AUS DEM MATHEMATISCHEN SEMINAR DER UNIVERSITAT HAMBURG, 2006, 76 (1): : 235 - 245
[22] Acyclic chromatic indices of planar graphs with large girth
Wang, Weifan
Shu, Qiaojun
Wang, Kan
Wang, Ping
DISCRETE APPLIED MATHEMATICS, 2011, 159 (12) : 1239 - 1253
[23] Odd Induced Subgraphs in Planar Graphs with Large Girth
Mengjiao Rao
Jianfeng Hou
Qinghou Zeng
Graphs and Combinatorics, 2022, 38
[24] Large induced forests in planar graphs with girth 4
Dross, Francois
Montassier, Mickael
Pinlou, Alexandre
DISCRETE APPLIED MATHEMATICS, 2019, 254 : 96 - 106
[25] STRONG CHROMATIC INDEX OF PLANAR GRAPHS WITH LARGE GIRTH
Chang, Gerard Jennhwa
Montassier, Mickael
Pecher, Arnaud
Raspaud, Andre
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2014, 34 (04) : 723 - 733
[26] Minimum cost homomorphism dichotomy for oriented cycles
Gutin, Gregory
Rafiey, Arash
Yeo, Anders
ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2008, 5034 : 224 - +
[27] Minimum Cost Homomorphism Dichotomy for Oriented Cycles
Gutin, Gregory
Rafiey, Arash
Yeo, Anders
GRAPHS AND COMBINATORICS, 2009, 25 (04) : 521 - 531
[28] Minimum Cost Homomorphism Dichotomy for Oriented Cycles
Gregory Gutin
Arash Rafiey
Anders Yeo
Graphs and Combinatorics, 2009, 25 : 521 - 531
[29] AN ORIENTED 7-COLOURING OF PLANAR GRAPHS WITH GIRTH AT LEAST 7
Borodin, O. V.
Ivanova, A. O.
SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2005, 2 : 222 - 229
[30] An Oriented 6-Coloring of Planar Graphs with Girth at Least 9
T. H. Marshall
Graphs and Combinatorics, 2016, 32 : 1101 - 1116

← 1 2 3 4 5 →