The edge-coloring of graphs with small genus

Full metadata record

DC Field	Value	Language
dc.contributor.author	Fan, HL	en_US
dc.contributor.author	Fu, HL	en_US
dc.date.accessioned	2014-12-08T15:38:29Z	-
dc.date.available	2014-12-08T15:38:29Z	-
dc.date.issued	2004-10-01	en_US
dc.identifier.issn	0381-7032	en_US
dc.identifier.uri	http://hdl.handle.net/11536/26349	-
dc.description.abstract	In this note, we prove that a graph is of class one if G can be embedded in a surface with positive characteristic and satisfies one of the following conditions: (i) Delta(G) greater than or equal to 3 and g(G) (the girth of G) greater than or equal to 8 (ii) Delta(G) greater than or equal to 4 and g(G) greater than or equal to 5; and (iii) Delta(G) greater than or equal to 5 and g(G) greater than or equal to 4.	en_US
dc.language.iso	en_US	en_US
dc.title	The edge-coloring of graphs with small genus	en_US
dc.type	Article	en_US
dc.identifier.journal	ARS COMBINATORIA	en_US
dc.citation.volume	73	en_US
dc.citation.issue		en_US
dc.citation.spage	219	en_US
dc.citation.epage	224	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000225269400024	-
dc.citation.woscount	0	-
Appears in Collections:	Articles