Results 41 to 50 of about 152,670 (312)
M2-Edge Colorings Of Cacti And Graph Joins
Discussiones Mathematicae Graph Theory, 2016 An edge coloring φ of a graph G is called an M2-edge coloring if |φ(v)| ≤ 2 for every vertex v of G, where φ(v) is the set of colors of edges incident with v. Let 𝒦2(G) denote the maximum number of colors used in an M2-edge coloring of G.
Czap Július +2 more
doaj +1 more source
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
, 2014 We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only one vertex color assignment at a time, while at all times maintaining a list coloring, given a list of allowed colors for each vertex ...
Hatanaka, Tatsuhiko +2 more
core +1 more source
Decompositions of Edge-Colored Complete Graphs
Journal of Combinatorial Theory, Series A, 2000 In this paper finite edge-\(r\)-colored directed graphs are considered. For a vertex \(x\) of an edge-\(r\)-colored digraph \(G\), the degree-vector of \(x\) is defined as the \(2r\)-vector \[ \tau (x)=(in_{1}(x),out_{1}(x),\ldots ,in_{r}(x),out_{r}(x)) \] where \(in_{j}(x)\) and \(out_{j}(x)\) denote, respectively, the indegree and outdegree of vertex
Lamken, Esther R., Wilson, Richard M.
openaire +1 more source
An Average Case NP-Complete Graph Coloring Problem
, 2017 NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a graph coloring
Levin, Leonid A. +1 more
core +1 more source
Complete colorings of planar graphs [PDF]
Discrete Applied Mathematics, 2019 In this paper, we study the achromatic and the pseudoachromatic numbers of planar and outerplanar graphs as well as planar graphs of girth 4 and graphs embedded on a surface. We give asymptotically tight results and lower bounds for maximal embedded graphs.
G. Araujo-Pardo +4 more
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Adverse childhood experiences (ACEs) are stressful or traumatic events prior to age 18 that are known to have a lasting impact on individuals’ health and well‐being. There is a gap in understanding the relationship between ACEs and Other Life Stressors and health status for adults with sickle cell disease (SCD).
Marsha Treadwell +8 more
wiley +1 more source
The existence of uniform hypergraphs for which the interpolation property of complete coloring fails [PDF]
, 2021 Nastaran Haghparast +2 more
openalex +2 more sources
The b$_q$-coloring of graphs [PDF]
Discrete Mathematics Letters, 2023 Brice Effantin
doaj +1 more source
Journal of Mathematics, 2023 Let G be a graph with V=VG. A nonempty subset S of V is called an independent set of G if no two distinct vertices in S are adjacent. The union of a class {S:S is an independent set of G} and ∅ is denoted by IG. For a graph H, a function f:V⟶IH is called
Nopparat Pleanmani +2 more
doaj +1 more source
Data Reduction for Graph Coloring Problems
, 2013 This paper studies the kernelization complexity of graph coloring problems with respect to certain structural parameterizations of the input instances. We are interested in how well polynomial-time data reduction can provably shrink instances of coloring
Bart M.P. Jansen +30 more
core +1 more source