Results 51 to 60 of about 14,237 (338)
An exact algorithm for the generalized list T-coloring problem [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Discrete ...
Konstanty Junosza-Szaniawski +1 more
doaj +1 more source
List Supermodular Coloring with Shorter Lists [PDF]
Combinatorica, 2018 In 1995, Galvin proved that a bipartite graph $G$ admits a list edge coloring if every edge is assigned a color list of length $Δ(G)$, the maximum degree of the graph. This result was improved by Borodin, Kostochka and Woodall, who proved that $G$ still admits a list edge coloring if every edge $e=st$ is assigned a list of $\max\{d_{G}(s), d_{G}(t ...
openaire +2 more sources
Discussiones Mathematicae Graph Theory, 2013 Given a graph G = (V,E) and a set Lv of admissible colors for each vertex v ∈ V (termed the list at v), a list coloring of G is a (proper) vertex coloring ϕ : V → S v2V Lv such that ϕ(v) ∈ Lv for all v ∈ V and ϕ(u) 6= ϕ(v) for all uv ∈ E.
Tuza Zsolt
doaj +1 more source
Additive List Coloring of Planar Graphs with Given Girth
Discussiones Mathematicae Graph Theory, 2020 An additive coloring of a graph G is a labeling of the vertices of G from {1, 2, . . . , k} such that two adjacent vertices have distinct sums of labels on their neighbors.
Brandt Axel +2 more
doaj +1 more source
Toward an Axiomatization of Strongly Possible Functional Dependencies
Vietnam Journal of Computer Science, 2021 In general, there are two main approaches to handle the missing data values problem in SQL tables. One is to ignore or remove any record with some missing data values.
Munqath Alattar, Attila Sali
doaj +1 more source
LIST COLORING OF BLOCK GRAPHS AND COMPLETE BIPARTITE GRAPHS
, 2021 List coloring is a vertex coloring of a graph where each vertex can be restricted to a list of allowed colors. For a given graph G and a set L(v) of colors for every vertex v, a list coloring is a function that maps every vertex v to a color in the list ...
Albert Khachik Sahakyan +1 more
core +1 more source
List Coloring Some Classes of 1-Planar Graphs [PDF]
, 2021 In list coloring we are given a graph G and a list assignment for G which assigns to each vertex of G a list of possible colors. We wish to find a coloring of the vertices of G such that each vertex uses a color from its list and adjacent vertices are ...
Barr, Sam
core
Pathwidth and Nonrepetitive List Coloring
The Electronic Journal of Combinatorics, 2016 A vertex coloring of a graph is nonrepetitive if there is no path in the graph whose first half receives the same sequence of colors as the second half. While every tree can be nonrepetitively colored with a bounded number of colors (4 colors is enough), Fiorenzi, Ochem, Ossona de Mendez, and Zhu recently showed that this does not extend to the list ...
Gagol, Adam +3 more
openaire +5 more sources
Sparsification Lower Bounds for List H-Coloring [PDF]
, 2020 We investigate the List H-Coloring problem, the generalization of graph coloring that asks whether an input graph G admits a homomorphism to the undirected graph H (possibly with loops), such that each vertex v ∈ V(G) is mapped to a vertex on its list L ...
Okrasa, Karolina +4 more
core +1 more source
List Edge Coloring of Planar Graphs without 6-Cycles with Two Chords
Discussiones Mathematicae Graph Theory, 2021 A graph G is edge-L-colorable if for a given edge assignment L = {L(e) : e ∈ E(G)}, there exists a proper edge-coloring φ of G such that φ(e) ∈ L(e) for all e ∈ E(G). If G is edge-L-colorable for every edge assignment L such that |L(e)| ≥ k for all e ∈ E(
Hu Linna, Sun Lei, Wu Jian-Liang
doaj +1 more source