Path extendability of claw-free graphs (Q2501583)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Path extendability of claw-free graphs |
scientific article; zbMATH DE number 5054433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Path extendability of claw-free graphs |
scientific article; zbMATH DE number 5054433 |
Statements
Path extendability of claw-free graphs (English)
0 references
14 September 2006
0 references
The authors prove the following result. Let \(G\) be a connected, locally connected, claw-free graph of order \(n\) and \(x,y\) be any two vertices of \(G\). If for any 2-cut \(S\), \(S\cap\{x,y\}=\emptyset\), then each \((x,y)\)-path of length less than \(n-1\) of \(G\) is extendable. This generalizes several related results known before.
0 references
detour
0 references
locally connected
0 references
path extendable
0 references
0 references
0.852333128452301
0 references
