نتایج جستجو برای: modular edge coloring

تعداد نتایج: 168217  

2000
Jeroen HINLOOPEN Charles van MARREWIJK

The concept of revealed comparative advantage as measured by the Balassa index is widely used in practice to determine a country’s weak and strong sectors. Interpreting the Balassa index is difficult however in view of the limited knowledge to date on the distribution of this index. We analyze the empirical distribution of the Balassa index and its stability and properties over time, using Japa...

Journal: :Graphs and Combinatorics 2005
Herbert Fleischner Stefan Szeider

We characterize edge-colored graphs in which every edge belongs to some properly colored cycle. We obtain our result by applying a characterization of 1-extendable graphs.

Journal: :Electronic Notes in Discrete Mathematics 2011
Hervé Hocquard Pascal Ochem Petru Valicov

Journal: :Contributions to Discrete Mathematics 2008
Csaba Mengyán

In this paper we show a natural extension of the idea used by Illés, Szőnyi and Wettl which proved that the flags of PG(2, q) can be partitioned into (q−1) √ q+3q strong representative systems for q an odd square. From a generalization of the Buekenhout construction of unitals their idea can be applied for any non-prime q to yield that q +2q strong representative systems partition the flags of ...

Journal: :J. Comb. Theory, Ser. B 1989
Amanda G. Chetwynd Anthony J. W. Hilton Dean G. Hoffman

2006
SUCHARIT SARKAR

In this short article, we shall try to find an explicit formula for Maslov index of triangles joining intersections points of three half-dimensional tori in the symmetric product of a surface. The method will also yield a formula for the intersection number of such a triangle with the flat diagonal in the symmetric product.

Journal: :Discrete Mathematics 2004
Andrea Hackmann Arnfried Kemnitz

2018
Sayan Bhattacharya Deeparnab Chakrabarty Monika Henzinger Danupon Nanongkai

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 (∆ + 1)vertex coloring and (2∆ − 1)-edge coloring in a graph with maximum degree ∆. It is natural to ask if we can efficiently maintain such colorings in the dynamic setting as well. We get the following th...

2014
Sheng-Hua Chen Gerard Jennhwa Chang

A strong edge-coloring of a graph is a function that assigns to each edge a color such that every two distinct edges that are adjacent or adjacent to a same edge receive different colors. The strong chromatic index χs(G) of a graph G is the minimum number of colors used in a strong edge-coloring of G. From a primal-dual point of view, there are three natural lower bounds of χs(G), that is σ(G) ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید