Colourability and word-representability of near-triangulations

DOI10.1515/puma-2015-0032zbMath1449.05094arXiv1605.01688OpenAlexW2987389311WikidataQ126847051 ScholiaQ126847051MaRDI QIDQ5217318

Marc Glen

Publication date: 26 February 2020

Published in: Pure Mathematics and Applications (Search for Journal in Brave)

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

zbMATH Keywords

triangulationpolyomino3-colorabilityword-representable graph

Mathematics Subject Classification ID

Combinatorics on words (68R15) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Solving computational problems in the theory of word-representable graphs

This page was built for publication: Colourability and word-representability of near-triangulations