Results 91 to 100 of about 82,445 (208)
Approximating Maximum Edge 2-Coloring by Normalizing Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn a simple, undirected graph G, an edge 2-coloring is a coloring of the edges such that no vertex is incident to edges with more than 2 distinct colors.
Tobias Mömke +4 more
doaj +1 more source
Theoretical Computer Science, 2009 We consider the class A of graphs that contain no odd hole, no antihole, and no ``prism'' (a graph consisting of two disjoint triangles with three disjoint paths between them). We show that the coloring algorithm found by the second and fourth author can be implemented in time O(n^2m) for any graph in A with n vertices and m edges, thereby improving on
Lévêque, Benjamin +3 more
openaire +4 more sources
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
Facial graceful coloring of plane graphs [PDF]
Opuscula MathematicaLet \(G\) be a plane graph. Two edges of \(G\) are facially adjacent if they are consecutive on the boundary walk of a face of \(G\). A facial edge coloring of \(G\) is an edge coloring such that any two facially adjacent edges receive different colors ...
Július Czap
doaj +1 more source
Discrete Mathematics, 2012 AbstractWe study a graph coloring game in which two players collectively color the vertices of a graph in the following way. In each round the first player (Ann) selects a vertex, and then the second player (Ben) colors it properly, using a fixed set of colors.
openaire +3 more sources
Journal of Combinatorial Theory, 1968 AbstractColored graphs are enumerated by an application of Pólya's counting theorem. The cycle indices of the appropriate permutation groups are determined by use of a slightly generalized version of Pólya's composition theorem. The counting theorem, as well as the product and composition of permutation groups, is reviewed in our notation.
openaire +3 more sources
Journal of Combinatorial Theory, Series B, 1978 A graph is called uniquely k-colorable if there is only one partition of its vertex set into k color classes. The first result of this note is that if a k-colorable graph G of order n is such that its minimal degree, δ(G), is greater than (3k−5)/(3k−2) n then it is uniquely k-colorable. This result can be strengthened considerably if one considers only
openaire +3 more sources
Channel Selection in Uncoordinated IEEE 802.11 Networks Using Graph Coloring. [PDF]
Sensors (Basel), 2023 Gimenez-Guzman JM +4 more
europepmc +1 more source
Discrete Mathematics, 2001 An orientation of a graph \(H\) is a digraph obtained from \(H\) by giving to each edge one of its two possible orientations. A digraph \(G\) is an oriented graph if it is an orientation of some graph \(H\). An oriented \(k\)-coloring of an oriented graph \(G\) is a partition of the vertex set of \(G\) into \(k\) color classes such that no two adjacent
openaire +3 more sources
Graph Coloring with webMathematica [PDF]
, 2004 Coloring of a graph is an assignment of colors either to the edges of the graph G, or to vertices, or to maps in such a way that adjacent edges/vertices/maps are colored differently. We consider the problem of coloring graphs by using webMathematica which is the new web-based technology. In this paper, we describe some web-based interactive examples on
Ufuktepe, Ünal +2 more
openaire +2 more sources