Buscar
Mostrando ítems 1-10 de 227
Recognizing Well Covered Graphs of Families with Special P (4)-Components
(Springer Japan KkTokyoJapão, 2013)
The approximate Loebl-Komlós-Sós conjecture I: The sparse decomposition
(Society for Industrial and Applied Mathematics Publications, 2017)
In a series of four papers we prove the following relaxation of the Loebl–Koml ́os–S ́os Con-jecture: For everyα >0 there exists a numberk0such that for everyk > k0everyn-vertexgraphGwith at least (12+α)nvertices of degree ...
Minimal separators in extended P-4-laden graphs
(Elsevier Science BvAmsterdamHolanda, 2012)
The approximate Loebl-Komlós-Sós conjecture II: The rough structure of LKS graphs
(Society for Industrial and Applied Mathematics, 2017)
This is the second of a series of four papers in which we prove the following relaxation of the Loebl-Komlós-Sós conjecture: For every α > 0 there exists a number k0 such that for every k > k0, every n-vertex graph ...
The clique operator on cographs and serial graphs
(Elsevier Science BvAmsterdamHolanda, 2004)
The clique operator on graphs with few P-4's
(Elsevier Science BvAmsterdamHolanda, 2006)
The approximate Loebl-Komlós-Sós conjecture III: The finer structure of LKS graphs
(Society for Industrial and Applied Mathematics, 2017)
This is the third of a series of four papers in which we prove the following relaxation ofthe Loebl–Komlós–S ́os Conjecture: For everyα >0 there exists a numberk0such that foreveryk > k0everyn-vertex ...
The approximate Loebl-Komlós-Sós conjecture IV: Embedding techniques and the proof of the main result
(Society for Industrial and Applied Mathematics Publications, 2017)
This is the last of a series of four papers in which we prove the following relaxation of the Loebl-Komlós-Sós conjecture: For every α > 0 there exists a number k0 such that for every k > k0, every n-vertex graph G ...
CHAIN DECOMPOSITIONS OF 4-CONNECTED GRAPHS
(Siam PublicationsPhiladelphiaEUA, 2005)
Total dominating sequences in trees, split graphs, and under modular decomposition
(Elsevier Science, 2018-05)
A sequence of vertices in a graph G with no isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at least one vertex that was not totally dominated by preceding vertices ...