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

Relating bends and size in orthogonal graph drawings

โœ Scribed by Therese C. Biedl

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
474 KB
Volume
65
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Combinatorially orthogonal matrices and
Combinatorially orthogonal matrices and related graphs
โœ Peter M. Gibson; Guo-Hui Zhang ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 814 KB

Let G be a graph and let c(x,y) denote the number of vertices in G adjacent to both of the vertices x and y. We call G quadrangular if c(x,y) ~ 1 whenever x and y are distinct vertices in G. Reid and Thomassen proved that IE(G)I >t 21V(G)I -4 for each connected quadrangular graph (7, and characteriz

Optimal three-dimensional orthogonal gra
Optimal three-dimensional orthogonal graph drawing in the general position model
โœ David R. Wood ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 636 KB

Let G be a graph with maximum degree at most six. A three-dimensional orthogonal drawing of G positions the vertices at grid-points in the three-dimensional orthogonal grid, and routes edges along grid lines such that edge routes only intersect at common end-vertices. In this paper, we consider thre

A linear Vizing-like relation relating t
A linear Vizing-like relation relating the size and total domination number of a graph
โœ Michael A. Henning ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 77 KB

## Abstract We prove that __m__โ€‰โ‰คโ€‰ฮ” (__n__โ€‰โˆ’โ€‰ฮณ~t~) for every graph each component of which has order at least 3 of order __n__, size __m__, total domination number ฮณ~t~, and maximum degree ฮ”โ€‰โ‰ฅโ€‰3. ยฉ 2005 Wiley Periodicals, Inc. J Graph Theory 49: 285โ€“290, 2005