Stability of Hereditary Graph Classes Under Closure Operations

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F13%3A43918750" target="_blank" >RIV/49777513:23520/13:43918750 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1002/jgt.21692" target="_blank" >http://dx.doi.org/10.1002/jgt.21692</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/jgt.21692" target="_blank" >10.1002/jgt.21692</a>

Result language
angličtina
Original language name
Stability of Hereditary Graph Classes Under Closure Operations
Original language description
If C is a subclass of the class of claw-free graphs, then C is said to be stable if, for any graph G from C, the local completion of G at any vertex is also in C. If cl is a closure operation that turns a claw-free graph into a line graph by a series oflocal completions and C is stable, then cl(G) belongs to C for any graph G from C. We consider stability of hereditary classes of claw-free graphs defined in terms of a family of connected closed forbidden induced subgraphs. We characterize line graph preimages of graphs in families that yield stable classes, we identify minimal families that yield stable classes in the finite case, and we also give a general background for techniques for handling unstable induced hereditary classes by proving that their closure may be included into another (possibly stable) class.
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)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

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

Similar results(10)