Matches in SemOpenAlex for { <https://semopenalex.org/work/W2788852080> ?p ?o ?g. }
- W2788852080 abstract "A graph is a mathematical structure consisting of a set of objects, which we call vertices, and links between pairs of objects, which we call edges. Graphs are used to model many problems arising in areas such as physics, sociology, and computer science.It is partially because of the simplicity of the definition of a graph that the concept can be so widely used. Nevertheless, when applied to a particular task, it is not always necessary to study graphs in all their generality, and it can be convenient to studying them from a restricted point of view. Restriction can come from requiring graphs to be embeddable in a particular surface, to admit certain types of decompositions, or by forbidding some substructure. A collection of graphs satisfying a fixed restriction forms a class of graphs.Many important classes of graphs satisfy that graphs belonging to it cannot have many edges in comparison with the number of vertices. Such is the case of classes with an upper bound on the maximum degree, and of classes excluding a fixed minor. Recently, the notion of classes with bounded expansion was introduced by Neˇsetˇril and Ossona de Mendez [62], as a generalisation of many important types of sparse classes. In this thesis we study chromatic and structural properties of classes with bounded expansion.We say a graph is k-degenerate if each of its subgraphs has a vertex of degree at most k. The degeneracy is thus a measure of the density of a graph. This notion has been generalised with the introduction, by Kierstead and Yang [47], of the generalised colouring numbers. These parameters have found applications in many areas of Graph Theory, including a characterisation of classes with bounded expansion. One of the main results of this thesis is a series of upper bounds on the generalised colouring numbers, for different sparse classes of graphs, such as classes excluding a fixed complete minor, classes with bounded genus and classes with bounded tree-width.We also study the following problem: for a fixed positive integer p, how many colours do we need to colour a given graph in such a way that vertices at distance exactly p get different colours? When considering classes with bounded expansion, we improve dramatically on the previously known upper bounds for the number of colours needed.Finally, we introduce a notion of addition of graph classes, and show various cases in which sparse classes can be summed so as to obtain another sparse class." @default.
- W2788852080 created "2018-03-06" @default.
- W2788852080 creator A5084351080 @default.
- W2788852080 date "2017-01-01" @default.
- W2788852080 modified "2023-09-23" @default.
- W2788852080 title "Chromatic and structural properties of sparse graph classes" @default.
- W2788852080 cites W1482193060 @default.
- W2788852080 cites W1523448599 @default.
- W2788852080 cites W174566906 @default.
- W2788852080 cites W1826325207 @default.
- W2788852080 cites W1965737603 @default.
- W2788852080 cites W1973674396 @default.
- W2788852080 cites W1991445030 @default.
- W2788852080 cites W1999552793 @default.
- W2788852080 cites W2003904409 @default.
- W2788852080 cites W2008440715 @default.
- W2788852080 cites W201590706 @default.
- W2788852080 cites W2017604542 @default.
- W2788852080 cites W2028766875 @default.
- W2788852080 cites W2029746920 @default.
- W2788852080 cites W2035331304 @default.
- W2788852080 cites W2036303537 @default.
- W2788852080 cites W2037713618 @default.
- W2788852080 cites W2037789845 @default.
- W2788852080 cites W2038500525 @default.
- W2788852080 cites W2039985220 @default.
- W2788852080 cites W2040404604 @default.
- W2788852080 cites W2044716204 @default.
- W2788852080 cites W2063951771 @default.
- W2788852080 cites W2067431706 @default.
- W2788852080 cites W2071321409 @default.
- W2788852080 cites W2083568668 @default.
- W2788852080 cites W2083586321 @default.
- W2788852080 cites W2089465933 @default.
- W2788852080 cites W2092864936 @default.
- W2788852080 cites W2098322943 @default.
- W2788852080 cites W2105137385 @default.
- W2788852080 cites W2107628600 @default.
- W2788852080 cites W2109300296 @default.
- W2788852080 cites W2124442576 @default.
- W2788852080 cites W2143305437 @default.
- W2788852080 cites W2144293155 @default.
- W2788852080 cites W2149284317 @default.
- W2788852080 cites W2149573503 @default.
- W2788852080 cites W2151438396 @default.
- W2788852080 cites W2156149469 @default.
- W2788852080 cites W2170758948 @default.
- W2788852080 cites W2281443803 @default.
- W2788852080 cites W2317079499 @default.
- W2788852080 cites W2401216365 @default.
- W2788852080 cites W2472847397 @default.
- W2788852080 cites W2756821311 @default.
- W2788852080 cites W2902301846 @default.
- W2788852080 cites W2963893440 @default.
- W2788852080 cites W2967584293 @default.
- W2788852080 cites W3032071526 @default.
- W2788852080 cites W594463866 @default.
- W2788852080 doi "https://doi.org/10.21953/lse.yczhu2j6vv7n" @default.
- W2788852080 hasPublicationYear "2017" @default.
- W2788852080 type Work @default.
- W2788852080 sameAs 2788852080 @default.
- W2788852080 citedByCount "1" @default.
- W2788852080 countsByYear W27888520802018 @default.
- W2788852080 crossrefType "dissertation" @default.
- W2788852080 hasAuthorship W2788852080A5084351080 @default.
- W2788852080 hasConcept C102192266 @default.
- W2788852080 hasConcept C114614502 @default.
- W2788852080 hasConcept C118615104 @default.
- W2788852080 hasConcept C127413603 @default.
- W2788852080 hasConcept C13251829 @default.
- W2788852080 hasConcept C132525143 @default.
- W2788852080 hasConcept C134306372 @default.
- W2788852080 hasConcept C15744967 @default.
- W2788852080 hasConcept C160446614 @default.
- W2788852080 hasConcept C196956537 @default.
- W2788852080 hasConcept C2777727622 @default.
- W2788852080 hasConcept C2780767217 @default.
- W2788852080 hasConcept C33923547 @default.
- W2788852080 hasConcept C34388435 @default.
- W2788852080 hasConcept C542102704 @default.
- W2788852080 hasConcept C59824394 @default.
- W2788852080 hasConcept C60644358 @default.
- W2788852080 hasConcept C66938386 @default.
- W2788852080 hasConcept C74133993 @default.
- W2788852080 hasConcept C86803240 @default.
- W2788852080 hasConcept C99679407 @default.
- W2788852080 hasConceptScore W2788852080C102192266 @default.
- W2788852080 hasConceptScore W2788852080C114614502 @default.
- W2788852080 hasConceptScore W2788852080C118615104 @default.
- W2788852080 hasConceptScore W2788852080C127413603 @default.
- W2788852080 hasConceptScore W2788852080C13251829 @default.
- W2788852080 hasConceptScore W2788852080C132525143 @default.
- W2788852080 hasConceptScore W2788852080C134306372 @default.
- W2788852080 hasConceptScore W2788852080C15744967 @default.
- W2788852080 hasConceptScore W2788852080C160446614 @default.
- W2788852080 hasConceptScore W2788852080C196956537 @default.
- W2788852080 hasConceptScore W2788852080C2777727622 @default.
- W2788852080 hasConceptScore W2788852080C2780767217 @default.
- W2788852080 hasConceptScore W2788852080C33923547 @default.
- W2788852080 hasConceptScore W2788852080C34388435 @default.