Results 11 to 20 of about 14,237 (338)
Exploring the complexity boundary between coloring and list-coloring [PDF]
Annals of Operations Research, 2008 Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring problem is NP-complete for many subclasses of perfect graphs.
Flavia Bonomo +2 more
exaly +4 more sources
Random Structures & Algorithms, 2023 AbstractList coloring is an influential and classic topic in graph theory. We initiate the study of a natural strengthening of this problem, where instead of one list‐coloring, we seek many in parallel. Our explorations have uncovered a potentially rich seam of interesting problems spanning chromatic graph theory. Given a ‐list‐assignment of a graph ,
Stijn Cambie +3 more
openaire +8 more sources
On the list dynamic coloring of graphs
Discrete Applied Mathematics, 2009 A proper vertex coloring of a graph G is called a dynamic coloring if for every vertex v of degree at least 2, the neighbors of v receive at least two different colors.
S Akbari, Sogol Jahanbekam
exaly +3 more sources
List Coloring Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2010 Let $H$ be a hypergraph and let $L_v : v \in V(H)$ be sets; we refer to these sets as lists and their elements as colors. A list coloring of $H$ is an assignment of a color from $L_v$ to each $v \in V(H)$ in such a way that every edge of $H$ contains a pair of vertices of different colors.
Penny E. Haxell, Jacques Verstraëte
openaire +3 more sources
Journal of Graph Theory, 2017 AbstractThe dichromatic number of a digraph D is the least number k such that the vertex set of D can be partitioned into k parts each of which induces an acyclic subdigraph. Introduced by Neumann‐Lara in 1982, this digraph invariant shares many properties with the usual chromatic number of graphs and can be seen as the natural analog of the graph ...
Bensmail, Julien +2 more
openaire +7 more sources
Coloring, list coloring, and fractional coloring in intersections of matroids [PDF]
CombinatoricaAbstract It is known that in matroids the difference between the chromatic number and the fractional chromatic number is smaller than 1, and that the list chromatic number is equal to the chromatic number. We investigate the gap within these pairs of parameters for hypergraphs that are the intersection of a given ...
Aharoni, Ron +3 more
+7 more sources
List Star Edge-Coloring of Subcubic Graphs
Discussiones Mathematicae Graph Theory, 2018 A star edge-coloring of a graph G is a proper edge coloring such that every 2-colored connected subgraph of G is a path of length at most 3. For a graph G, let the list star chromatic index of G, ch′st(G), be the minimum k such that for any k-uniform ...
Kerdjoudj Samia +2 more
doaj +3 more sources
List-coloring embedded graphs [PDF]
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013 14 pages, 0 figures, accepted to SODA ...
Zdenek Dvorák 0001 +1 more
openaire +4 more sources
List-coloring and sum-list-coloring problems on graphs
, 2012 Graph coloring is a well-known and well-studied area of graph theory that has many applications. In this dissertation, we look at two generalizations of graph coloring known as list-coloring and sum-list-coloring. In both of these types of colorings, one
Lastrina, Michelle
core +3 more sources
Linear List Coloring of Some Sparse Graphs
Discussiones Mathematicae Graph Theory, 2021 A linear k-coloring of a graph is a proper k-coloring of the graph such that any subgraph induced by the vertices of any pair of color classes is a union of vertex-disjoint paths. A graph G is linearly L-colorable if there is a linear coloring c of G for
Chen Ming, Li Yusheng, Zhang Li
doaj +2 more sources