BOOK THICKNESS OF A GRAPH

被引：231

作者：

BERNHART, F

KAINEN, PC

机构：

[1] UNIV WATERLOO,FAC MATH,DEPT COMBINATOR & OPTIMIZAT,WATERLOO N2L 3G1,ONTARIO,CANADA

[2] CASE WESTERN RESERVE UNIV,DEPT MATH & STAT,CLEVELAND,OH 44106

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 1979年 / 27卷 / 03期

关键词：

D O I：

10.1016/0095-8956(79)90021-2

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The book thickness bt(G) of a graph G is defined, its basic properties are delineated, and relations are given with other invariants such as thickness, genus, and chromatic number. A graph G has book thickness bt(G) ≤ 2 if and only if it is a subgraph of a hamiltonian planar graph, but we conjecture that there are planar graphs with arbitrarily high book thickness. © 1979.

引用

页码：320 / 331

页数：12