Online-Ressource
Cambridge University Press (CUP)
;
1983
In:
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics Vol. 35, No. 2 ( 1983-10), p. 211-217
In:
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, Cambridge University Press (CUP), Vol. 35, No. 2 ( 1983-10), p. 211-217
Kurzfassung:
An undirected simple graph G is called chordal if every circle of G of length greater than 3 has a chord. For a chordal graph G , we prove the following: (i) If m is an odd positive integer, G m is chordal. (ii) If m is an even positive integer and if G m is not chordal, then none of the edges of any chordless cycle of G m is an edge of G r , r 〈 m .
Materialart:
Online-Ressource
ISSN:
0263-6115
DOI:
10.1017/S1446788700025696
Sprache:
Englisch
Verlag:
Cambridge University Press (CUP)
Publikationsdatum:
1983
ZDB Id:
2008847-4
ZDB Id:
1478743-X
SSG:
17,1
Permalink
|
Standort |
Signatur |
Einschränkungen |
Verfügbarkeit |