The splitting number of the 4-cube

The splitting number of a graph G is the smallest integer k ≥ 0 such that a planar graph can be obtained from G by k splitting operations. Such operation replaces v by two nonadjacent vertices v1 and v2, and attaches the neighbors of v either to v1 or to v2. The n-cube has a distinguished plaice in...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Faria, Luerbio, de Figueiredo, Celina Miraglia Herrera, de MendonÇa Neto, Candido Ferreira Xavier
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Auxiliary Graph Black Vertex Complete Bipartite Graph Computer science control theory systems Exact sciences and technology Information retrieval. Graph Layout Algorithm Nonadjacent Vertex Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!