File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: The maximum number of diagonals of a cycle in a block and its extremal graphs

TitleThe maximum number of diagonals of a cycle in a block and its extremal graphs
Authors
Issue Date1991
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/disc
Citation
Discrete Mathematics, 1991, v. 89 n. 1, p. 51-63 How to Cite?
AbstractIn this paper we show that if G is a 2-connected graph having minimum degree n such that |V(G)|;≥2n+1, then there exists a cycle in G having more than n(n-2) diagonals, unless G is Kn,m,m>n or the Petersen graph. So the conjecture posed by Gupta, Kahn and Robertson is settled completely. © 1991.
Persistent Identifierhttp://hdl.handle.net/10722/156216
ISSN
2015 Impact Factor: 0.6
2015 SCImago Journal Rankings: 1.000

 

DC FieldValueLanguage
dc.contributor.authorTian, Fen_US
dc.contributor.authorZang, Wen_US
dc.date.accessioned2012-08-08T08:40:52Z-
dc.date.available2012-08-08T08:40:52Z-
dc.date.issued1991en_US
dc.identifier.citationDiscrete Mathematics, 1991, v. 89 n. 1, p. 51-63en_US
dc.identifier.issn0012-365Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/156216-
dc.description.abstractIn this paper we show that if G is a 2-connected graph having minimum degree n such that |V(G)|;≥2n+1, then there exists a cycle in G having more than n(n-2) diagonals, unless G is Kn,m,m>n or the Petersen graph. So the conjecture posed by Gupta, Kahn and Robertson is settled completely. © 1991.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.titleThe maximum number of diagonals of a cycle in a block and its extremal 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/0012-365X(91)90399-M-
dc.identifier.scopuseid_2-s2.0-44949275882en_US
dc.identifier.volume89en_US
dc.identifier.issue1en_US
dc.identifier.spage51en_US
dc.identifier.epage63en_US
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridTian, F=7103096614en_US
dc.identifier.scopusauthoridZang, W=7005740804en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats