On 2-Colorability Problem for Hypergraphs with P_8-free Incidence Graphs
2019 ◽
Vol 17
(2)
◽
pp. 257-263
Keyword(s):
A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. The hypergraph 2- Coloring Problem is the question whether a given hypergraph is 2-colorable. It is known that deciding the 2-colorability of hypergraphs is NP-complete even for hypergraphs whose hyperedges have size at most 3. In this paper, we present a polynomial time algorithm for deciding if a hypergraph, whose incidence graph is P_8-free and has a dominating set isomorphic to C_8, is 2-colorable or not. This algorithm is semi generalization of the 2-colorability algorithm for hypergraph, whose incidence graph is P_7-free presented by Camby and Schaudt.
Keyword(s):
Keyword(s):
2010 ◽
Vol 21
(06)
◽
pp. 905-924
◽
2010 ◽
Vol 20
(01)
◽
pp. 89-104
◽
Keyword(s):
2016 ◽
Vol 13
(1)
◽
pp. 11-15
Keyword(s):
2013 ◽
Vol 18
(11)
◽
pp. 159-165
◽
Keyword(s):