Path extendability of claw-free graphs (Q2501583): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3958496 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Claw-free graphs---a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connected, locally 2-connected,K1,3-free graphs are panconnected / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Every connected, locally connected nontrivial graph with no induced claw is hamiltonian / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Panconnectivity of locally connected claw-free graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4381781 / rank | |||
Normal rank |
Latest revision as of 20:27, 24 June 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
0 references