Results 201 to 210 of about 5,891 (239)

Consecutive Edge-Colorings of Generalized θ-Graphs

2011
A proper edge-coloring of a graph G using positive integers as colors is said to be a consecutive edge-coloring if for each vertex the colors of edges incident form an interval of integers. Recently, Feng and Huang studied the consecutive edge-coloring of generalized θ-graphs.
Yongqiang Zhao, Gerard J. Chang
openaire   +1 more source

Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs

Discrete Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Narda Cordero-Michel, Hortensia Galeana-Sánchez   +1 more
openaire   +2 more sources

On the existence of generalized good and equitable edge colorings

Journal of Graph Theory, 1981
AbstractSome classes of graphs are described which are extensions of bipartite multigraphs. Exclusion of some specific partial subgraphs gives some properties of edge colorability. in particular sufficient conditions are developed for the existence of generalized good and equitable colorings.
openaire   +2 more sources

Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs

SIAM Journal on Computing, 2003
Summary: \textit{S.-P. Chung} and \textit{K. W. Ross} [SIAM J. Comput. 20, 726--736 (1991; Zbl 0727.94014)] conjectured that the minimum number \(m(n,r)\) of middle-stage switches for the symmetric 3-stage Clos network \(C(n,m(n,r),r)\) to be rearrangeable in the multirate environment is at most \(2n-1\).
Hung Q. Ngo 0001, Van H. Vu
openaire   +2 more sources

Generalities on edge colored graphs

2016
AbstractThis chapter discusses the edge colored graphs in detail. It first presents the cellular structure of such graphs and shows that they are dual to vertex colored triangulations in any dimension. It subsequently introduces the notions of open edge colored graphs and boundary graphs, and relates them to triangulations with boundary.
openaire   +1 more source

Generalized Mumford-Shah Model and Fast Algorithm for Color Image Restoration and Edge Detection

Third International Conference on Image and Graphics (ICIG'04), 2005
A generalized Mumford-Shah model for color image restoration and edge detection is established in this paper. First the color images are considered as the manifold based on the "surface based method", then a new physical quantity in the form of vector product, which describes the differences of the gradient between different channels, is introduced ...
Liang Xiao 0001, Huizhong Wu, Zhihui Wei
openaire   +1 more source

Unconstrained logo and trademark retrieval in general color image databases using Color Edge Gradient Co-occurrence Histograms

2008 IEEE International Conference on Acoustics, Speech and Signal Processing, 2008
In this paper, we present a logo and trademark retrieval system for general, unconstrained, color image databases, extending the color edge co-occurrence histogram (CECH) object detection scheme. We introduce more accurate information to the CECH, by virtue of incorporating color edge detection using vector order statistics.
Raymond Phan, John Chia, Dimitrios Androutsos   +2 more
openaire   +1 more source

Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs

Mathematical Notes of the Academy of Sciences of the USSR, 1990
In 1955 Kotzig proved that each 3-polytope contains an edge with the degree sum of its end vertices (weight) at most 13. Let \(e_{i,j}\) be the number of edges joining vertices of degree \(i\) with those of degree \(j\), and let \(\delta\) and \(\Delta\) be the minimum and maximum degrees of a graph under consideration.
openaire   +2 more sources

Midwest theory of computation symposium

ACM SIGACT News, 1984
Bounds are given on the number of colors required to color the edges of a graph (multigraph) such that each color appears at each vertex v at most m(v) times. The known results and proofs generalize in natural ways. Certain new edge-coloring problems, which have no counterparts when m(v) = 1 for all vεV, are studied.
S. Louis Hakimi, Oded Kariv
openaire   +1 more source

Logo and Trademark Retrieval in General Image Databases Using Color Edge Gradient Co-occurrence Histograms

2007
In this paper, we present a logo and trademark retrieval system for general, unconstrained, color image databases that extends the Color Edge Co-occurrence Histogram (CECH) object detection scheme. We introduce more accurate information to the CECH, by virtue of incorporating color edge detection using vector order statistics.
Raymond Phan, Dimitrios Androutsos
openaire   +1 more source