Akers et al. proposed an interconnection topology, the star graph, as an alternative to the popular n n n-cube. Cheng et al. proposed the split-star as an alternative to the star graph and a companion graph to the alternating group graph proposed by Jwo et al. Star graphs, alternating group graphs,
Alternating orientation and alternating colouration of perfect graphs
✍ Scribed by C.T Hoàng
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 559 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Grossman and Ha ggkvist gave a sufficient condition under which a two-edgecoloured graph must have an alternating cycle (i.e., a cycle in which no two consecutive edges have the same colour). We extend their result to edge-coloured graphs with any number of colours. That is, we show that if there is
We show that the edges of a 2-connected graph can be partitioned into two color classes so that every vertex is incident with edges of each color and every alternating cycle passes through a single edge. We also show that the edges of a simple graph with minimum vertex degree 6 2 2 can be partitione
This paper proves that if a graph G has an orientation D such that for each cycle C with djCj ðmod kÞ 2 f1; 2; . . . ; 2d À 1g we have jCj=jC þ j4k=d and jCj=jC À j4k=d; then G has a ðk; dÞ-colouring and hence w c ðGÞ4k=d: This is a generalization of a result of Tuza (J. Combin. Theory Ser. B 55 (19