Results 291 to 300 of about 33,621 (316)
Some of the next articles are maybe not open access.
Uncertain vertex coloring problem
Soft Computing, 2017This paper investigates the vertex coloring problem in an uncertain graph in which all vertices are deterministic, while all edges are not deterministic and exist with some degree of belief in uncertain measures. The concept of the maximal uncertain independent vertex set of an uncertain graph is first introduced.
Dan A. Ralescu, Lin Chen, Jin Peng
openaire +2 more sources
2016
In Chap. 2 and 3, we described two edge colorings that give rise to two vertex colorings, one in terms of sets of colors and the other in terms of multisets. Now, in this chapter and the next, the situation is reversed, as we describe vertex colorings that give rise to edge colorings.
openaire +2 more sources
In Chap. 2 and 3, we described two edge colorings that give rise to two vertex colorings, one in terms of sets of colors and the other in terms of multisets. Now, in this chapter and the next, the situation is reversed, as we describe vertex colorings that give rise to edge colorings.
openaire +2 more sources
Vertex coloring edge-weighted digraphs
Information Processing Letters, 2015We consider vertex colorings of edge-weighted graphs.We give tight upper and lower bounds on the chromatic number in terms of degree parameters.The results have implications for wireless scheduling in physical models of interference. A coloring of a digraph with non-negative edge weights is a partition of the vertex set into independent sets, where a ...
Jørgen Bang-Jensen +1 more
openaire +3 more sources
2016
In this chapter, we study vertex colorings of graphs, where the colors are elements of \(\mathbb{Z}_{k}\) or of [k] for some integer k ≥ 2. These give rise to either edge-distinguishing labelings or proper edge colorings defined in a variety of ways.
openaire +2 more sources
In this chapter, we study vertex colorings of graphs, where the colors are elements of \(\mathbb{Z}_{k}\) or of [k] for some integer k ≥ 2. These give rise to either edge-distinguishing labelings or proper edge colorings defined in a variety of ways.
openaire +2 more sources
On vertex-parity edge-colorings
Journal of Combinatorial Optimization, 2017A vertex signature $$\pi $$ of a finite graph G is any mapping $$\pi \,{:}\,V(G)\rightarrow \{0,1\}$$
Riste Škrekovski +3 more
openaire +2 more sources
Mesh Simplification with Vertex Color
2008In a resource-constrained computing environment, it is essential to simplify complex meshes of a huge 3D model for visualization, storing and transmission. Over the past few decades, quadric error metric (QEM) has been the most popular error evaluation method for mesh simplification because of its fast computation time and good quality of approximation.
Han Kyun Choi, Hyun Soo Kim, Kwan H. Lee
openaire +2 more sources
Note on the reconstruction of vertex colored graphs
Journal of Graph Theory, 1987AbstractWe show that if the Reconstruction Conjecture is true for uncolored (vertex‐monochromatic) simple graphs, then it is also true for vertex‐colored simple graphs.
openaire +2 more sources
Cryo-EM structures of herpes simplex virus type 1 portal vertex and packaged genome
Nature, 2019Yun-Tao Liu, Jonathan Jih, Xinghong Dai
exaly