Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph

DOI10.7155/jgaa.00256zbMath1254.05048MaRDI QIDQ3143738

Bojan Mohar, Petr Škoda

Publication date: 4 December 2012

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00256

zbMATH Keywords

linear-time fixed-parameter tractable algorithm

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

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

05C85: Graph algorithms (graph-theoretic aspects)