Matches in SemOpenAlex for { <https://semopenalex.org/work/W3135516946> ?p ?o ?g. }
Showing items 1 to 52 of
52
with 100 items per page.
- W3135516946 endingPage "743" @default.
- W3135516946 startingPage "743" @default.
- W3135516946 abstract "We consider the following list coloring with separation problem of graphs: Given a graph $G$ and integers $a,b$, find the largest integer $c$ such that for any list assignment $L$ of $G$ with $|L(v)|le a$ for any vertex $v$ and $|L(u)cap L(v)|le c$ for any edge $uv$ of $G$, there exists an assignment $varphi$ of sets of integers to the vertices of $G$ such that $varphi(u)subset L(u)$ and $|varphi(v)|=b$ for any vertex $v$ and $varphi(u)cap varphi(v)=emptyset$ for any edge $uv$. Such a value of $c$ is called the separation number of $(G,a,b)$. We also study the variant called the free-separation number which is defined analogously but assuming that one arbitrary vertex is precolored. We determine the separation number and free-separation number of the cycle and derive from them the free-separation number of a cactus. We also present a lower bound for the separation and free-separation numbers of outerplanar graphs of girth $gge 5$." @default.
- W3135516946 created "2021-03-15" @default.
- W3135516946 creator A5030818290 @default.
- W3135516946 creator A5045655458 @default.
- W3135516946 date "2023-01-01" @default.
- W3135516946 modified "2023-10-14" @default.
- W3135516946 title "Choosability with separation of cycles and outerplanar graphs" @default.
- W3135516946 doi "https://doi.org/10.7151/dmgt.2398" @default.
- W3135516946 hasPublicationYear "2023" @default.
- W3135516946 type Work @default.
- W3135516946 sameAs 3135516946 @default.
- W3135516946 citedByCount "0" @default.
- W3135516946 crossrefType "journal-article" @default.
- W3135516946 hasAuthorship W3135516946A5030818290 @default.
- W3135516946 hasAuthorship W3135516946A5045655458 @default.
- W3135516946 hasBestOaLocation W31355169461 @default.
- W3135516946 hasConcept C114614502 @default.
- W3135516946 hasConcept C125792925 @default.
- W3135516946 hasConcept C132525143 @default.
- W3135516946 hasConcept C203776342 @default.
- W3135516946 hasConcept C33923547 @default.
- W3135516946 hasConcept C43517604 @default.
- W3135516946 hasConceptScore W3135516946C114614502 @default.
- W3135516946 hasConceptScore W3135516946C125792925 @default.
- W3135516946 hasConceptScore W3135516946C132525143 @default.
- W3135516946 hasConceptScore W3135516946C203776342 @default.
- W3135516946 hasConceptScore W3135516946C33923547 @default.
- W3135516946 hasConceptScore W3135516946C43517604 @default.
- W3135516946 hasIssue "3" @default.
- W3135516946 hasLocation W31355169461 @default.
- W3135516946 hasLocation W31355169462 @default.
- W3135516946 hasLocation W31355169463 @default.
- W3135516946 hasLocation W31355169464 @default.
- W3135516946 hasOpenAccess W3135516946 @default.
- W3135516946 hasPrimaryLocation W31355169461 @default.
- W3135516946 hasRelatedWork W2008657595 @default.
- W3135516946 hasRelatedWork W2024201669 @default.
- W3135516946 hasRelatedWork W2138118431 @default.
- W3135516946 hasRelatedWork W2908070433 @default.
- W3135516946 hasRelatedWork W2952125186 @default.
- W3135516946 hasRelatedWork W3046954261 @default.
- W3135516946 hasRelatedWork W3119883127 @default.
- W3135516946 hasRelatedWork W3128546310 @default.
- W3135516946 hasRelatedWork W4287180630 @default.
- W3135516946 hasRelatedWork W2528128964 @default.
- W3135516946 hasVolume "43" @default.
- W3135516946 isParatext "false" @default.
- W3135516946 isRetracted "false" @default.
- W3135516946 magId "3135516946" @default.
- W3135516946 workType "article" @default.