All face 2-colorable d-angulations are Grünbaum colorable

zbMATH Open1337.05043arXiv1501.01261MaRDI QIDQ2809952FDOQ2809952

Abdulkarim M. Magomedov, Serge Lawrencenko

Publication date: 30 May 2016

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Abstract: A $d$-angulation of a surface is an embedding of a 3-connected graph on that surface that divides it into $d$-gonal faces. A $d$-angulation is said to be Gr"unbaum colorable if its edges can be $d$-colored so that every face uses all $d$ colors. Up to now, the concept of Gr"unbaum coloring has been related only to triangulations ($d=3$), but in this note, this concept is generalized for an arbitrary face size $dgeqslant3$. It is shown that the face 2-colorability of a $d$-angulation $P$ implies the Gr"unbaum colorability of $P$. Some wide classes of triangulations have turned out to be face 2-colorable.

Full work available at URL: https://arxiv.org/abs/1501.01261

zbMATH Keywords

coloring\(d\)-angulation of surface

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Coloring of graphs and hypergraphs (05C15) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Relations of low-dimensional topology with graph theory (57M15)

Cited In (3)

• Generating even triangulations on the torus
• Title not available (Why is that?)
• Grünbaum colorings extended to non-facial 3-cycles

This page was built for publication: All face 2-colorable \(d\)-angulations are Grünbaum colorable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2809952)