๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Cutwidth of Split Graphs and Threshold Graphs

โœ Scribed by Heggernes, Pinar; Lokshtanov, Daniel; Mihai, Rodica; Papadopoulos, Charis

Book ID
118197058
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
418 KB
Volume
25
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Maximum cutwidth problem for graphs
Maximum cutwidth problem for graphs
โœ Jianxiu Hao ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› SP Editorial Committee of Applied Mathematics - A ๐ŸŒ English โš– 303 KB
Graphs with small bandwidth and cutwidth
Graphs with small bandwidth and cutwidth
โœ F.R.K. Chung; P.D. Seymour ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 442 KB

We give counter-examples to the following conjecture which arose in the study of small bandwidth graphs. "For a graph G, suppose that IV(G')( < 1 + ci . diameter (G') for any connected subgraph G' of G, and that G does not contain any refinement of the complete binary tree of cz levels. Is it true

Split dimension of graphs
Split dimension of graphs
โœ Arkady A. Chernyak; Zhanna A. Chernyak ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 380 KB

## Chernyak, A.A. and Z.A. Chernyak, Split dimension of graphs, Discrete Mathematics 89 (1991) l-6.