Premium
Long paths and large cycles in finite graphs
Author(s) -
Enomoto Hikoe
Publication year - 1984
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190080209
Subject(s) - mathematics , combinatorics , path (computing) , indifference graph , type (biology) , discrete mathematics , graph , computer science , programming language , ecology , biology
Ore‐type sufficient conditions ensuring the existence of a large cycle passing through any given path of length s for ( s + 2)‐connected graphs are given, and the extremal cases are characterized.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom