The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F10%3A00503513" target="_blank" >RIV/49777513:23520/10:00503513 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs
Original language description
Ryjáček introduced a closure concept for claw-free graphs based on local completion of a locally connected vertex. Connected graphs A, for which the class of (C,A)-free graphs is stable under the closure, were completely characterized. In this paper, weintroduce a variation of the closure concept based on local completion of a locally connected edge of a claw-free graph. The closure is uniquely determined and preserves the value of the circumference of a graph. We show that the class of (C,A)-free graphs is stable under the edge-closure if A in {H,Pi,Ni,j,k}.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)