Coupled choosability of near-outerplanar graphs

Hetherington, T.J., 2014. Coupled choosability of near-outerplanar graphs. Ars Combinatoria, 113, pp. 23-32. ISSN 0381-7032

Full text not available from this repository.

Abstract

It is proved that if G is a plane embedding of a K4-minor-free graph, then G is coupled 5-choosable; that is, if every vertex and every face of G is given a list of 5 colours, then each of these elements can be given a colour from its list such that no two adjacent or incident elements are given the same colour. Using this result it is proved also that if G is a plane embedding of a K2,3-minor-free graph or a (K¯2 + (K1 [ K2))-minor-free graph, then G is coupled 5-choosable. All results here are sharp, even for outerplane graphs.

Item Type:	Journal article
Publication Title:	Ars Combinatoria
Creators:	Hetherington, T.J.
Publisher:	The Charles Babbage Research Centre
Place of Publication:	Winnipeg, Manitoba
Date:	2014
Volume:	113
ISSN:	0381-7032
Divisions:	Schools > School of Science and Technology
Record created by:	EPrints Services
Date Added:	09 Oct 2015 10:57
Last Modified:	19 Oct 2015 14:39
URI:	https://irep.ntu.ac.uk/id/eprint/20692

Actions (login required)

Edit View

Views

Downloads