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

Chromaticity of the complements of paths and cycles

โœ Scribed by Qingyan Du

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
742 KB
Volume
162
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The mean chromatic number of paths and c
The mean chromatic number of paths and cycles
โœ Martin Anthony; Norman Biggs ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 245 KB

The mean chromatic number of a graph is defined. This is a measure of the expected performance of the greedy vertex-colouring algorithm when each ordering of the vertices is equally likely. In this note, we analyse the asymptotic behaviour of the mean chromatic number for the paths and even cycles,

The Square of Paths and Cycles
The Square of Paths and Cycles
โœ G.H. Fan; H.A. Kierstead ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 388 KB

The square of a path (cycle) is the graph obtained by joining every pair of vertices of distance two in the path (cycle). Let \(G\) be a graph on \(n\) vertices with minimum degree \(\delta(G)\). Posa conjectured that if \(\delta(G) \geqslant \frac{2}{3} n\), then \(G\) contains the square of a hami

Path chromatic numbers of graphs
Path chromatic numbers of graphs
โœ Jin Akiyama; Hiroshi Era; Severino V. Gervacio; Mamoru Watanabe ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 112 KB
Rank and biclique partitions of the comp
Rank and biclique partitions of the complement of paths
โœ Boyer, Elizabeth D. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 230 KB ๐Ÿ‘ 1 views

The problem was posed of determining the biclique partition number of the complement of a Hamiltonian path (Monson, Rees, and Pullman, Bull. Inst. Combinatorics and Appl. 14 (1995), 17-86). We define the complement of a path P , denoted P , as the complement of P in K m,n where P is a subgraph of K