3-Colorability of plane hypergraphs (Q3798696)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4065036
Language Label Description Also known as
default for all languages
No label defined
    English
    3-Colorability of plane hypergraphs
    scientific article; zbMATH DE number 4065036

      Statements

      3-Colorability of plane hypergraphs (English)
      0 references
      0 references
      0 references
      1987
      0 references
      planar triangulation
      0 references
      quasi-colourability
      0 references
      3-colourability
      0 references
      planar hypergraphs
      0 references
      0 references
      A hypergraph \(H=(X,E)\) with the vertex set X and the edge set E is called planar if G with the vertex set \(X\cup E\) and the edge set \(\{\) (x,e): (x,e)\(\in X\cup E\); \(x\in e\}\) is a planar graph. The paper concerns with sufficient conditions for the 3-colourability of planar hypergraphs. Note that this problem is not less difficult than the NP-complete problem of 3-colourability of planar graphs. Each planar hypergraph H is assigned the graph H' made up of the edges of degree 2 of H and its incident vertices. Let X(H') denote the vertex set of H', s(H') the maximum degree of the vertices of this graph and \(m_ 2(H)\) the number of the edges of degree 2 of the hypergraph H. Then the planar hypergraph H is 3-colourable if s(H')\(\leq 2\) and any hypergraph edge e with \(e\cap X(H')\neq \emptyset\) has degree \(\leq m_ 2(H)-5.\) From this result one can deduce chromatic properties of planar graphs.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references