Results 41 to 50 of about 1,904 (164)
Strong parity vertex coloring of plane graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 A strong parity vertex coloring of a 2-connected plane graph is a coloring of the vertices such that every face is incident with zero or an odd number of vertices of each color.
Tomas Kaiser +3 more
doaj +1 more source
RECYCLING SOLUTIONS FOR VERTEX COLORING HEURISTICS
Journal of the Operations Research Society of Japan, 2021 The vertex coloring problem is a well-known NP-hard problem and has many applications in operations research and in scheduling. A conventional approach to the problem solves the k-colorability problem iteratively, decreasing k one by one. Whether a heuristic algorithm finds a legal k-coloring quickly or not is largely affected by an initial solution ...
Uchida, Yasutaka +2 more
openaire +3 more sources
Inclusive Local Irregularity Vertex Coloring In Grid Graph Family
Cauchy: Jurnal Matematika Murni dan AplikasiLet is a simple graph and connected where is vertex set and is edge set. A maping as vertex k- labeling and function : is inclusive local irregularity vertex coloring, with .
Arika Indah Kristiana +5 more
doaj +1 more source
Animation Visualization for Vertex Coloring of Polyhedral Graphs [PDF]
Journal of Systemics, Cybernetics and Informatics, 2013 Vertex coloring of a graph is the assignment of labels to the vertices of the graph so that adjacent vertices have different labels. In the case of polyhedral graphs, the chromatic number is 2, 3, or 4. Edge coloring problem and face coloring problem can
Hidetoshi Nonaka
doaj
Finding and Counting Vertex-Colored Subtrees [PDF]
Algorithmica, 2010 Conference version in International Symposium on Mathematical Foundations of Computer Science (MFCS), Brno : Czech Republic (2010) Journal Version in ...
Guillemot, Sylvain, Sikora, Florian
openaire +4 more sources
The list Distinguishing Number Equals the Distinguishing Number for Interval Graphs
Discussiones Mathematicae Graph Theory, 2017 A distinguishing coloring of a graph G is a coloring of the vertices so that every nontrivial automorphism of G maps some vertex to a vertex with a different color. The distinguishing number of G is the minimum k such that G has a distinguishing coloring
Immel Poppy, Wenger Paul S.
doaj +1 more source
A Min-Max theorem about the Road Coloring Conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The Road Coloring Conjecture is an old and classical conjecture e posed in Adler and Weiss (1970); Adler et al. (1977). Let $G$ be a strongly connected digraph with uniform out-degree $2$.
Rajneesh Hegde, Kamal Jain
doaj +1 more source
Regular inference as vertex coloring
Theoretical Computer Science, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Costa Florêncio, C., Verwer, S.
openaire +4 more sources
Zhejiang Daxue xuebao. Lixue ban, 2017 A proper k-edge coloring of a graph G is an assignment of k colors 1, 2, …, k to edges of G such that any two adjacent edges receive the different colors.
WANGGuoxing(王国兴)
doaj +1 more source
Cauchy: Jurnal Matematika Murni dan AplikasiThis article discusses a local antimagic coloring which is a combination between antimagic labeling and coloring. It is a new notion. We define a vertex weight of as where is the set of edges incident to .
R. Sunder +5 more
doaj +1 more source