Degree Sums and Covering Cycles

Hikoe Enomoto, Atsushi Kaneko, Mekkia Kouider, Z. Tuza

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

It is shown that if in a simple graph G of order n the sum of degrees of any three pairwise non‐adjacent vertices is at least n, then there are two cycles (or one cycle and an edge or a vertex) of GF that contain all the vertices. © 1995 John Wiley & Sons, Inc.

Original languageEnglish
Pages (from-to)419-422
Number of pages4
JournalJournal of Graph Theory
Volume20
Issue number4
DOIs
Publication statusPublished - 1995

Fingerprint

Degree Sum
Covering
Cycle
Simple Graph
Pairwise
Vertex of a graph

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

Degree Sums and Covering Cycles. / Enomoto, Hikoe; Kaneko, Atsushi; Kouider, Mekkia; Tuza, Z.

In: Journal of Graph Theory, Vol. 20, No. 4, 1995, p. 419-422.

Research output: Contribution to journalArticle

Enomoto, H, Kaneko, A, Kouider, M & Tuza, Z 1995, 'Degree Sums and Covering Cycles', Journal of Graph Theory, vol. 20, no. 4, pp. 419-422. https://doi.org/10.1002/jgt.3190200405
Enomoto, Hikoe ; Kaneko, Atsushi ; Kouider, Mekkia ; Tuza, Z. / Degree Sums and Covering Cycles. In: Journal of Graph Theory. 1995 ; Vol. 20, No. 4. pp. 419-422.
@article{daa1fd85475e4d87aa0465f51c4889ac,
title = "Degree Sums and Covering Cycles",
abstract = "It is shown that if in a simple graph G of order n the sum of degrees of any three pairwise non‐adjacent vertices is at least n, then there are two cycles (or one cycle and an edge or a vertex) of GF that contain all the vertices. {\circledC} 1995 John Wiley & Sons, Inc.",
author = "Hikoe Enomoto and Atsushi Kaneko and Mekkia Kouider and Z. Tuza",
year = "1995",
doi = "10.1002/jgt.3190200405",
language = "English",
volume = "20",
pages = "419--422",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "4",

}

TY - JOUR

T1 - Degree Sums and Covering Cycles

AU - Enomoto, Hikoe

AU - Kaneko, Atsushi

AU - Kouider, Mekkia

AU - Tuza, Z.

PY - 1995

Y1 - 1995

N2 - It is shown that if in a simple graph G of order n the sum of degrees of any three pairwise non‐adjacent vertices is at least n, then there are two cycles (or one cycle and an edge or a vertex) of GF that contain all the vertices. © 1995 John Wiley & Sons, Inc.

AB - It is shown that if in a simple graph G of order n the sum of degrees of any three pairwise non‐adjacent vertices is at least n, then there are two cycles (or one cycle and an edge or a vertex) of GF that contain all the vertices. © 1995 John Wiley & Sons, Inc.

UR - http://www.scopus.com/inward/record.url?scp=84987589000&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84987589000&partnerID=8YFLogxK

U2 - 10.1002/jgt.3190200405

DO - 10.1002/jgt.3190200405

M3 - Article

AN - SCOPUS:84987589000

VL - 20

SP - 419

EP - 422

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 4

ER -