On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph

DOI10.1007/978-3-642-25011-8_24zbMath1344.05053MaRDI QIDQ3111659

Bojan Mohar, Petr Škoda

Publication date: 13 January 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25011-8_24

zbMATH Keywords

planar graph; fixed-parameter tractable; label transitions

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C85: Graph algorithms (graph-theoretic aspects)