Matches in SemOpenAlex for { <https://semopenalex.org/work/W4297201724> ?p ?o ?g. }
Showing items 1 to 57 of
57
with 100 items per page.
- W4297201724 abstract "A connected ordering $(v_1, v_2, ldots, v_n)$ of $V(G)$ is an ordering of the vertices such that $v_i$ has at least one neighbour in ${v_1, ldots, v_{i - 1}}$ for every $i in {2, ldots, n}$. A connected greedy coloring (CGC for short) is a coloring obtained by applying the greedy algorithm to a connected ordering. This has been first introduced in 1989 by Hertz and de Werra, but still very little is known about this problem. An interesting aspect is that, contrary to the traditional greedy coloring, it is not always true that a graph has a connected ordering that produces an optimal coloring; this motivates the definition of the connected chromatic number of $G$, which is the smallest value $chi_c(G)$ such that there exists a CGC of $G$ with $chi_c(G)$ colors. An even more interesting fact is that $chi_c(G) le chi(G)+1$ for every graph $G$ (Benevides et. al. 2014). In this paper, in the light of the dichotomy for the coloring problem restricted to $H$-free graphs given by Kr'al et.al. in 2001, we are interested in investigating the problems of, given an $H$-free graph $G$: (1). deciding whether $chi_c(G)=chi(G)$; and (2). given also a positive integer $k$, deciding whether $chi_c(G)le k$. We have proved that Problem (2) has the same dichotomy as the coloring problem (i.e., it is polynomial when $H$ is an induced subgraph of $P_4$ or of $P_3+K_1$, and it is NP-complete otherwise). As for Problem (1), we have proved that $chi_c(G) = chi(G)$ always hold when $G$ is an induced subgraph of $P_5$ or of $P_4+K_1$, and that it is NP-hard to decide whether $chi_c(G)=chi(G)$ when $H$ is not a linear forest or contains an induced $P_9$. We mention that some of the results actually involve fixed $k$ and fixed $chi(G)$." @default.
- W4297201724 created "2022-09-27" @default.
- W4297201724 creator A5067431925 @default.
- W4297201724 creator A5077033122 @default.
- W4297201724 creator A5080609495 @default.
- W4297201724 date "2018-07-24" @default.
- W4297201724 modified "2023-09-27" @default.
- W4297201724 title "Connected greedy coloring $H$-free graphs" @default.
- W4297201724 doi "https://doi.org/10.48550/arxiv.1807.09034" @default.
- W4297201724 hasPublicationYear "2018" @default.
- W4297201724 type Work @default.
- W4297201724 citedByCount "0" @default.
- W4297201724 crossrefType "posted-content" @default.
- W4297201724 hasAuthorship W4297201724A5067431925 @default.
- W4297201724 hasAuthorship W4297201724A5077033122 @default.
- W4297201724 hasAuthorship W4297201724A5080609495 @default.
- W4297201724 hasBestOaLocation W42972017241 @default.
- W4297201724 hasConcept C11413529 @default.
- W4297201724 hasConcept C114614502 @default.
- W4297201724 hasConcept C118615104 @default.
- W4297201724 hasConcept C123809776 @default.
- W4297201724 hasConcept C132525143 @default.
- W4297201724 hasConcept C149530733 @default.
- W4297201724 hasConcept C158319403 @default.
- W4297201724 hasConcept C203776342 @default.
- W4297201724 hasConcept C33923547 @default.
- W4297201724 hasConcept C38767284 @default.
- W4297201724 hasConcept C51823790 @default.
- W4297201724 hasConcept C76444178 @default.
- W4297201724 hasConceptScore W4297201724C11413529 @default.
- W4297201724 hasConceptScore W4297201724C114614502 @default.
- W4297201724 hasConceptScore W4297201724C118615104 @default.
- W4297201724 hasConceptScore W4297201724C123809776 @default.
- W4297201724 hasConceptScore W4297201724C132525143 @default.
- W4297201724 hasConceptScore W4297201724C149530733 @default.
- W4297201724 hasConceptScore W4297201724C158319403 @default.
- W4297201724 hasConceptScore W4297201724C203776342 @default.
- W4297201724 hasConceptScore W4297201724C33923547 @default.
- W4297201724 hasConceptScore W4297201724C38767284 @default.
- W4297201724 hasConceptScore W4297201724C51823790 @default.
- W4297201724 hasConceptScore W4297201724C76444178 @default.
- W4297201724 hasLocation W42972017241 @default.
- W4297201724 hasOpenAccess W4297201724 @default.
- W4297201724 hasPrimaryLocation W42972017241 @default.
- W4297201724 hasRelatedWork W1974068132 @default.
- W4297201724 hasRelatedWork W2018072810 @default.
- W4297201724 hasRelatedWork W2025457119 @default.
- W4297201724 hasRelatedWork W2042876012 @default.
- W4297201724 hasRelatedWork W2151059773 @default.
- W4297201724 hasRelatedWork W2950062088 @default.
- W4297201724 hasRelatedWork W4237246883 @default.
- W4297201724 hasRelatedWork W4288274833 @default.
- W4297201724 hasRelatedWork W4324108759 @default.
- W4297201724 hasRelatedWork W3213280609 @default.
- W4297201724 isParatext "false" @default.
- W4297201724 isRetracted "false" @default.
- W4297201724 workType "article" @default.