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

Strong orientations of complete k-partite graphs achieving the strong diameter

โœ Scribed by Huifang Miao; Guoping Lin

Book ID
108154679
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
192 KB
Volume
110
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Families of graphs complete for the stro
Families of graphs complete for the strong perfect graph Conjecture
โœ D. G. Corneil ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 381 KB ๐Ÿ‘ 1 views

The Strong Perfect Graph Conjecture states that a graph is perfect iff neither it nor its complement contains an odd chordless cycle of size greater than or equal to 5. In this article it is shown that many families of graphs are complete for this conjecture in the sense that the conjecture is true

The strong chromatic index of complete c
The strong chromatic index of complete cubic Halin graphs
โœ W.C. Shiu; W.K. Tam ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 809 KB

A complete cubic Halin graph is a cubic Halin graph whose characteristic tree is a complete cubic tree, in which all leaves are at the same distance from the root vertex. In this work, we determine the strong chromatic index of the complete cubic Halin graph.

The diameter of an orientation of a comp
The diameter of an orientation of a complete multipartite graph
โœ K.M. Koh; B.P. Tan ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 390 KB

For a graph G, let e(G) denote the minimum value of the diameters diamD of D, where D runs through all the orientations of G. In this paper, we obtain some results on e(G) for complete multipartite graphs G, which extend some known results due to Boesch and Tindell [1] and Maurer [4].