Results 11 to 20 of about 92,928 (333)
Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Let $G$ be a graph and $\mathcal{S}$ be a subset of $Z$. A vertex-coloring $\mathcal{S}$-edge-weighting of $G$ is an assignment of weights by the elements of $\mathcal{S}$ to each edge of $G$ so that adjacent vertices have different sums of incident ...
Hongliang Lu
doaj +1 more source
Distinguishing colorings of graphs and their subgraphs
AIMS Mathematics, 2023 In this paper, several distinguishing colorings of graphs are studied, such as vertex distinguishing proper edge coloring, adjacent vertex distinguishing proper edge coloring, vertex distinguishing proper total coloring, adjacent vertex distinguishing ...
Baolin Ma, Chao Yang
doaj +1 more source
Planar graphs with $\Delta \geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 For planar graphs, we consider the problems of list edge coloring and list total coloring. Edge coloring is the problem of coloring the edges while ensuring that two edges that are adjacent receive different colors.
Marthe Bonamy +2 more
doaj +1 more source
Journal of Combinatorial Theory, Series B, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Balister, P.N. +3 more
openaire +2 more sources
AVD edge-colorings of cubic Halin graphs
AIMS Mathematics, 2023 The adjacent vertex-distinguishing edge-coloring of a graph $ G $ is a proper edge-coloring of $ G $ such that each pair of adjacent vetices receives a distinct set of colors.
Ningge Huang , Lily Chen
doaj +1 more source
Dynamic Algorithms for Graph Coloring [PDF]
, 2017 We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for $(\Delta+1)$- vertex coloring and $(2\Delta-1)$-edge coloring ...
Bhattacharya, Sayan +3 more
core +2 more sources
Algorithmica, 2016 A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to at least one vertex in each other color class. The b-chromatic number of $G$ is the maximum integer $b(G)$ for which $G$ has a b-coloring with $b(G)$ colors.
Victor Campos, FERREIRA DA SILVA A
openaire +2 more sources
Edge-Coloring Bipartite Graphs [PDF]
Journal of Algorithms, 2000 This note provides an algorithm for finding \(\Delta\)(colors)-edge-coloring of a bipartite graph of order \(n\) and size \(m\) in time \(T+O(m\log \Delta)\) where \(T\) is the time needed to find a perfect matching in a \(k\)-regular bipartite graph, \(k\leq \Delta\), and \(\Delta\) is the maximum degree of vertices.
A. Kapoor, Rizzi, Romeo
openaire +3 more sources
Graphs with coloring redundant edges
Electronic Journal of Graph Theory and Applications, 2016 A graph edge is $d$-coloring redundant if the removal of the edge doesnot change the set of $d$-colorings of the graph. Graphs that are toosparse or too dense do not have coloring redundant edges.
Bart Demoen, Phuong-Lan Nguyen
doaj +1 more source
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs [PDF]
Graphs and Combinatorics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Ruonan +2 more
openaire +2 more sources