File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Coloring graphs with no odd-K4

TitleColoring graphs with no odd-K4
Authors
Zang, W
Issue Date1998
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/disc
Citation
Discrete Mathematics, 1998, v. 184 n. 1-3, p. 205-212 How to Cite?
DOI: http://dx.doi.org/10.1016/S0012-365X(97)00090-3
AbstractThe purpose of this note is to present a polynomial-time algorithm which, given an arbitrary graph G as its input, finds either a proper 3-coloring of G or an odd-K4 that is a subgraph of G in time O(mn), where m and n stand for the number of edges and the number of vertices of G, respectively. © 1998 Published by Elsevier Science B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/156114
ISSN
0012-365X
2023 Impact Factor: 0.7
2023 SCImago Journal Rankings: 0.801
ISI Accession Number ID
WOS:000072499300015
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorZang, Wen_US
dc.date.accessioned2012-08-08T08:40:27Z-
dc.date.available2012-08-08T08:40:27Z-
dc.date.issued1998en_US
dc.identifier.citationDiscrete Mathematics, 1998, v. 184 n. 1-3, p. 205-212en_US
dc.identifier.issn0012-365Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/156114-
dc.description.abstractThe purpose of this note is to present a polynomial-time algorithm which, given an arbitrary graph G as its input, finds either a proper 3-coloring of G or an odd-K4 that is a subgraph of G in time O(mn), where m and n stand for the number of edges and the number of vertices of G, respectively. © 1998 Published by Elsevier Science B.V. All rights reserved.en_US
dc.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/discen_US
dc.relation.ispartofDiscrete Mathematicsen_US
dc.rightsDiscrete Mathematics. Copyright © Elsevier BV.-
dc.titleColoring graphs with no odd-K4en_US
dc.typeArticleen_US
dc.identifier.emailZang, W:wzang@maths.hku.hken_US
dc.identifier.authorityZang, W=rp00839en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/S0012-365X(97)00090-3-
dc.identifier.scopuseid_2-s2.0-0042357625en_US
dc.identifier.hkuros35077-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0042357625&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume184en_US
dc.identifier.issue1-3en_US
dc.identifier.spage205en_US
dc.identifier.epage212en_US
dc.identifier.isiWOS:000072499300015-
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridZang, W=7005740804en_US
dc.identifier.issnl0012-365X-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats