Matches in SemOpenAlex for { <https://semopenalex.org/work/W1780766934> ?p ?o ?g. }
Showing items 1 to 62 of
62
with 100 items per page.
- W1780766934 abstract "A solution to a problem of ErdH{o}s, Rubin and Taylor is obtained by showing that if a graph $G$ is $(a:b)$-choosable, and $c/d > a/b$, then $G$ is not necessarily $(c:d)$-choosable. The simplest case of another problem, stated by the same authors, is settled, proving that every 2-choosable graph is also $(4:2)$-choosable. Applying probabilistic methods, an upper bound for the $k^{th}$ choice number of a graph is given. We also prove that a directed graph with maximum outdegree $d$ and no odd directed cycle is $(k(d+1):k)$-choosable for every $k geq 1$. Other results presented in this article are related to the strong choice number of graphs (a generalization of the strong chromatic number). We conclude with complexity analysis of some decision problems related to graph choosability." @default.
- W1780766934 created "2016-06-24" @default.
- W1780766934 creator A5025279118 @default.
- W1780766934 date "2008-02-15" @default.
- W1780766934 modified "2023-09-27" @default.
- W1780766934 title "Choice numbers of graphs" @default.
- W1780766934 cites W1530753374 @default.
- W1780766934 cites W2011039300 @default.
- W1780766934 cites W2082249316 @default.
- W1780766934 cites W2143474538 @default.
- W1780766934 cites W2146017177 @default.
- W1780766934 cites W2905110430 @default.
- W1780766934 hasPublicationYear "2008" @default.
- W1780766934 type Work @default.
- W1780766934 sameAs 1780766934 @default.
- W1780766934 citedByCount "1" @default.
- W1780766934 countsByYear W17807669342021 @default.
- W1780766934 crossrefType "posted-content" @default.
- W1780766934 hasAuthorship W1780766934A5025279118 @default.
- W1780766934 hasConcept C114614502 @default.
- W1780766934 hasConcept C118615104 @default.
- W1780766934 hasConcept C132525143 @default.
- W1780766934 hasConcept C134306372 @default.
- W1780766934 hasConcept C177148314 @default.
- W1780766934 hasConcept C196956537 @default.
- W1780766934 hasConcept C33923547 @default.
- W1780766934 hasConcept C77553402 @default.
- W1780766934 hasConceptScore W1780766934C114614502 @default.
- W1780766934 hasConceptScore W1780766934C118615104 @default.
- W1780766934 hasConceptScore W1780766934C132525143 @default.
- W1780766934 hasConceptScore W1780766934C134306372 @default.
- W1780766934 hasConceptScore W1780766934C177148314 @default.
- W1780766934 hasConceptScore W1780766934C196956537 @default.
- W1780766934 hasConceptScore W1780766934C33923547 @default.
- W1780766934 hasConceptScore W1780766934C77553402 @default.
- W1780766934 hasLocation W17807669341 @default.
- W1780766934 hasOpenAccess W1780766934 @default.
- W1780766934 hasPrimaryLocation W17807669341 @default.
- W1780766934 hasRelatedWork W1505555274 @default.
- W1780766934 hasRelatedWork W167453680 @default.
- W1780766934 hasRelatedWork W1822118105 @default.
- W1780766934 hasRelatedWork W1968496968 @default.
- W1780766934 hasRelatedWork W1984128946 @default.
- W1780766934 hasRelatedWork W2024436752 @default.
- W1780766934 hasRelatedWork W2050352628 @default.
- W1780766934 hasRelatedWork W2467975867 @default.
- W1780766934 hasRelatedWork W2516984173 @default.
- W1780766934 hasRelatedWork W2900958825 @default.
- W1780766934 hasRelatedWork W2901140853 @default.
- W1780766934 hasRelatedWork W2951369935 @default.
- W1780766934 hasRelatedWork W2952461506 @default.
- W1780766934 hasRelatedWork W2962706353 @default.
- W1780766934 hasRelatedWork W2979496305 @default.
- W1780766934 hasRelatedWork W2979919423 @default.
- W1780766934 hasRelatedWork W2995369736 @default.
- W1780766934 hasRelatedWork W3036520051 @default.
- W1780766934 hasRelatedWork W3124770589 @default.
- W1780766934 hasRelatedWork W63822114 @default.
- W1780766934 isParatext "false" @default.
- W1780766934 isRetracted "false" @default.
- W1780766934 magId "1780766934" @default.
- W1780766934 workType "article" @default.