The Planar Hajós Calculus for Bounded Degree Graphs

The planar Hajós calculus (PHC) is the Hajós calculus with the restriction that all the graphs that appear in the construction (including a final graph) must be planar. The degree-d planar Hajós calculus (PHC(d)) is PHC with the restriction that all the graphs that appear in the construction (includ...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2010/06/01, Vol.E93.A(6), pp.1000-1007
Hauptverfasser:	IWAMA, Kazuo, SETO, Kazuhisa, TAMAKI, Suguru
Format:	Artikel
Sprache:	eng
Schlagworte:	bounded degree graph Calculus coloring Constrictions Construction Electronics Graphs Hajós calculus Mathematical analysis planar graph proof system
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!