File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Odd-K4's in stability critical graphs

TitleOdd-K4's in stability critical graphs
Authors
KeywordsStability Critical Graph
Stable Set
Subdivision
Issue Date2009
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/disc
Citation
Discrete Mathematics, 2009, v. 309 n. 20, p. 5982-5985 How to Cite?
AbstractA subdivision of K4 is called an odd-K4 if each triangle of the K4 is subdivided to form an odd cycle, and is called a fully odd-K4 if each of the six edges of the K4 is subdivided into a path of odd length. A graph G is called stability critical if the deletion of any edge from G increases the stability number. In 1993, Sewell and Trotter conjectured that in a stability critical graph every triple of edges which share a common end is contained in a fully odd-K4. The purpose of this note is to show that such a triple is contained in an odd-K4. © 2009 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/156243
ISSN
2015 Impact Factor: 0.6
2015 SCImago Journal Rankings: 1.000
ISI Accession Number ID
Funding AgencyGrant Number
Research Grants Council of Hong Kong
HKU
Funding Information:

The second author was supported in part by the Research Grants Council of Hong Kong and Seed Funding for Basic Research of HKU

References

 

DC FieldValueLanguage
dc.contributor.authorChen, Zen_US
dc.contributor.authorZang, Wen_US
dc.date.accessioned2012-08-08T08:40:59Z-
dc.date.available2012-08-08T08:40:59Z-
dc.date.issued2009en_US
dc.identifier.citationDiscrete Mathematics, 2009, v. 309 n. 20, p. 5982-5985en_US
dc.identifier.issn0012-365Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/156243-
dc.description.abstractA subdivision of K4 is called an odd-K4 if each triangle of the K4 is subdivided to form an odd cycle, and is called a fully odd-K4 if each of the six edges of the K4 is subdivided into a path of odd length. A graph G is called stability critical if the deletion of any edge from G increases the stability number. In 1993, Sewell and Trotter conjectured that in a stability critical graph every triple of edges which share a common end is contained in a fully odd-K4. The purpose of this note is to show that such a triple is contained in an odd-K4. © 2009 Elsevier 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.subjectStability Critical Graphen_US
dc.subjectStable Seten_US
dc.subjectSubdivisionen_US
dc.titleOdd-K4's in stability critical graphsen_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/j.disc.2009.04.029en_US
dc.identifier.scopuseid_2-s2.0-70349524999en_US
dc.identifier.hkuros170503-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-70349524999&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume309en_US
dc.identifier.issue20en_US
dc.identifier.spage5982en_US
dc.identifier.epage5985en_US
dc.identifier.isiWOS:000271256900011-
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridChen, Z=35209850800en_US
dc.identifier.scopusauthoridZang, W=7005740804en_US
dc.identifier.citeulike5018080-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats