Premium
A short proof for the Faudree‐Schelp theorem on path‐connected graphs
Author(s) -
XiaoTao Cai
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.3190080112
Subject(s) - mathematics , combinatorics , robertson–seymour theorem , path (computing) , discrete mathematics , longest path problem , 1 planar graph , graph , chordal graph , computer science , programming language
In this note a shortened proof is given for the Faudree—Schelp theorem on path‐connected graphs.