A characterisation of cubic parity graphs

dc.creator	Barbosa, Rommel Melgaço
dc.creator	Ellingham, Mark Norman
dc.date.accessioned	2018-06-06T11:16:10Z
dc.date.available	2018-06-06T11:16:10Z
dc.date.issued	2003
dc.description.abstract	A graph is Zm-well-covered if all maximal independent sets have the same cardinality modulo m. Zm-well-covered graphs generalise well-covered graphs, those in which all independent sets have the same cardinality. Z2- well-covered graphs are also called parity graphs. A characterisation of cubic well-covered graphs was given by Campbell, Ellingham and Royle. Here we extend this to a characterisation of cubic Zm-well-covered graphs for all integers m ≥ 2; the most interesting case is m = 2, cubic parity graphs. Our main technique involves minimal non-well-covered graphs, and allows us to build our characterisation as an extension of the existing characterisation of cubic well-covered graphs.	pt_BR
dc.identifier.citation	BARBOSA, Rommel; ELLINGHAM, M. N. A characterisation of cubic parity graphs. Australasian Journal of Combinatorics, Queensland, v. 28, p. 273-293, 2003.	pt_BR
dc.identifier.issn	e- 2202-3518
dc.identifier.uri	http://repositorio.bc.ufg.br/handle/ri/15149
dc.language.iso	eng	pt_BR
dc.publisher.country	Austrália	pt_BR
dc.publisher.department	Instituto de Informática - INF (RG)	pt_BR
dc.rights	Acesso Aberto	pt_BR
dc.title	A characterisation of cubic parity graphs	pt_BR
dc.type	Artigo	pt_BR

Arquivos

Agora exibindo 1 - 1 de 1

Agora exibindo 1 - 1 de 1