FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W421418441> ?p ?o ?g. }

• W421418441 abstract "Part 1: Domination Game and its variantsDomination game is a combinatorial game that consists in marking vertices of a graph so that a marked vertex has no marked neighbors. The first player unable to mark a vertex loses the game.Since the computing of winning strategies is an NP-hard problem for any graphs, we examine some specific families of graphs such as complete k-partite graphs, paths or saws. For these families, we establish the set of losing elements. For other families, such as caterpillars, we prove that exists a polynomial algorithm for the computation of outcome and winning strategies. No polynomial algorithm has been found to date for more general families, such as trees.We also study 28 variants of Domination game, including the 12 variants defined by J. Conway for any combinatorial game. Using game functions, we find the set of losing paths for 10 of these 12 variants. We also investigate 16 variants called diameter, for instance when rules require to play on the component that has the largest diameter.Part 2: The game chromatic number of treesThis parameter is computed from a coloring game: Alice and Bob alternatively color the vertices of a graph G, using one of the k colors in the color set. Alice has to achieve the coloring of the entire graph whereas Bob has to prevent this. Faigle and al. proved that the game chromatic number of a tree is at most 4. We undertake characterization of trees with a game chromatic number of 3. Since this problem seems difficult for general trees, we focus on sub-families: 1-caterpillars and caterpillars without holes.For these families we provide the characterization and also compute winning strategies for Alice and Bob. In order to do so, we are led to define a new notion, the bitype, that for a partially-colored graph G associates two letters indicating who has a winning strategy respectively on G and G with an isolated vertex. Bitypes allow us to demonstrate several properties, in particular to compute the game chromatic number of a graph from the bitypes of its connected components." @default.
• W421418441 created "2016-06-24" @default.
• W421418441 creator A5047984786 @default.
• W421418441 date "2011-12-06" @default.
• W421418441 modified "2023-09-23" @default.
• W421418441 title "Jeux de coloration de graphes" @default.
• W421418441 cites W137844391 @default.
• W421418441 cites W1504440667 @default.
• W421418441 cites W1986020220 @default.
• W421418441 cites W1988939889 @default.
• W421418441 cites W1997601467 @default.
• W421418441 cites W1998136751 @default.
• W421418441 cites W1999263269 @default.
• W421418441 cites W2028179941 @default.
• W421418441 cites W2080911904 @default.
• W421418441 cites W2092587468 @default.
• W421418441 cites W2097571405 @default.
• W421418441 cites W2107628600 @default.
• W421418441 cites W2127827517 @default.
• W421418441 cites W2144293155 @default.
• W421418441 cites W2261622378 @default.
• W421418441 cites W2295838866 @default.
• W421418441 cites W2330301979 @default.
• W421418441 cites W2508891437 @default.
• W421418441 cites W2914858890 @default.
• W421418441 cites W2994106552 @default.
• W421418441 hasPublicationYear "2011" @default.
• W421418441 type Work @default.
• W421418441 sameAs 421418441 @default.
• W421418441 citedByCount "0" @default.
• W421418441 crossrefType "dissertation" @default.
• W421418441 hasAuthorship W421418441A5047984786 @default.
• W421418441 hasConcept C102234262 @default.
• W421418441 hasConcept C114614502 @default.
• W421418441 hasConcept C118615104 @default.
• W421418441 hasConcept C123809776 @default.
• W421418441 hasConcept C132525143 @default.
• W421418441 hasConcept C144237770 @default.
• W421418441 hasConcept C149530733 @default.
• W421418441 hasConcept C158319403 @default.
• W421418441 hasConcept C177142836 @default.
• W421418441 hasConcept C196956537 @default.
• W421418441 hasConcept C199594403 @default.
• W421418441 hasConcept C203776342 @default.
• W421418441 hasConcept C21642379 @default.
• W421418441 hasConcept C33923547 @default.
• W421418441 hasConcept C73795354 @default.
• W421418441 hasConcept C76946457 @default.
• W421418441 hasConcept C80899671 @default.
• W421418441 hasConceptScore W421418441C102234262 @default.
• W421418441 hasConceptScore W421418441C114614502 @default.
• W421418441 hasConceptScore W421418441C118615104 @default.
• W421418441 hasConceptScore W421418441C123809776 @default.
• W421418441 hasConceptScore W421418441C132525143 @default.
• W421418441 hasConceptScore W421418441C144237770 @default.
• W421418441 hasConceptScore W421418441C149530733 @default.
• W421418441 hasConceptScore W421418441C158319403 @default.
• W421418441 hasConceptScore W421418441C177142836 @default.
• W421418441 hasConceptScore W421418441C196956537 @default.
• W421418441 hasConceptScore W421418441C199594403 @default.
• W421418441 hasConceptScore W421418441C203776342 @default.
• W421418441 hasConceptScore W421418441C21642379 @default.
• W421418441 hasConceptScore W421418441C33923547 @default.
• W421418441 hasConceptScore W421418441C73795354 @default.
• W421418441 hasConceptScore W421418441C76946457 @default.
• W421418441 hasConceptScore W421418441C80899671 @default.
• W421418441 hasLocation W4214184411 @default.
• W421418441 hasOpenAccess W421418441 @default.
• W421418441 hasPrimaryLocation W4214184411 @default.
• W421418441 isParatext "false" @default.
• W421418441 isRetracted "false" @default.
• W421418441 magId "421418441" @default.
• W421418441 workType "dissertation" @default.