Path extendability of claw-free graphs (Q2501583): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.03.057 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2012935677 / rank | |||
Normal rank |
Revision as of 02:49, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Path extendability of claw-free graphs |
scientific article |
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