NP-completeness of 4-incidence colorability of semi-cubic graphs
نویسندگان
چکیده
منابع مشابه
NP-completeness of 4-incidence colorability of semi-cubic graphs
The incidence coloring conjecture, proposed by Brualdi and Massey in 1993, states that the incidence coloring number of every graph is at most ∆ + 2, where ∆ is the maximum degree of a graph. The conjecture was shown to be false in general by Guiduli in 1997, following the work of Algor and Alon. However, in 2005 Maydanskiy proved that the conjecture holds for any graph with ∆ ≤ 3. It is easily...
متن کاملNP-completeness of 4-incidence colorability of a semi-cubic graph
be the set of all incidences of G. We say that two incidences (v, e) and (w, f) are adjacent if one of the following holds : (1) v = w ; (2) e = f ; and (3) the edge vw equals to e or f. 2 Definitions and Notations we view G as a digraph by splitting each edge uv into two opposite arcs (u, v) and (v, u). For e = uv, we identify the incidence (u, e) with the arc (u, v). By a slight abuse of nota...
متن کامل4-colorability of P6-free graphs
In this paper we will study the complexity of 4-colorability in subclasses of P6-free graphs. The well known k-colorability problem is NP -complete. It has been shown that if k-colorability is solvable in polynomial time for an induced H-free graph, then every component of H is a path. Recently, Huang [11] has shown several improved complexity results on k-coloring Pt-free graphs, where Pt is a...
متن کاملLecture 4 : More NP - completeness , NP - search , coNP
We first observe that NP-completeness immediately follows forCNFSAT and SAT since 3SAT ≤p CNFSAT ≤p SAT . Note that 3SAT ⊂ CNFSAT ⊂ SAT . The reduction in each case is almost the identity (though of course it can’t be since the sets are different). The only issue is that we have to modify satisfiable formulas that are not in 3CNF. For the 3SAT ≤p CNFSAT reduction we simply map any input that is...
متن کاملGroup Colorability of Graphs
Let G = (V,E) be a graph and A a non-trivial Abelian group, and let F (G,A) denote the set of all functions f : E(G) → A. Denote by D an orientation of E(G). Then G is A-colorable if and only if for every f ∈ F (G,A) there exists an A-coloring c: V (G) → A such that for every e = (x, y) ∈ E(G) (assumed to be directed from x to y), c(x) − c(y) 6= f(e). If G is a graph, we define its group chroma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.03.076