Results 261 to 270 of about 10,769 (289)

Note on the game chromatic index of trees [PDF]

Theoretical Computer Science, 2004
We study edge coloring games defining the so-called game chromatic index of a graph. It has been reported that the game chromatic index of trees with maximum degree Δ=3 is at most Δ+1.
Peter Erdos, Ulrich Faigle, Walter Kern   +2 more
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Chromatic index of simple hypergraphs

Discrete Mathematics, 2020
The authors consider the problem of edge coloring of simple hypergraphs. There is a very well-known conjecture given independly by \textit{C. Berge} [in: Combinatorial mathematics, Proc. 3rd Int. Conf., New York/ NY (USA) 1985, Ann. N. Y. Acad. Sci. 555, 40--44 (1989; Zbl 0726.05055)] and \textit{Z. Füredi} [Graphs Comb. 2, 89--92 (1986; Zbl 0589.05036)
Guo-Hui Zhang, Brett Skinner
openaire   +1 more source

The b-Chromatic Index of a Graph

Bulletin of the Malaysian Mathematical Sciences Society, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jakovac, Marko, Peterin, Iztok
openaire   +2 more sources

Determining the chromatic index of music

Proceedings Third International Conference on WEB Delivering of Music, 2004
Musical diachrony and synchrony have revealed an incredible variation in musical scales, many of which are implied, lurking in traditional patterns and not adequately transcribed in their projection to the dominant Western music predicates. From antiquity the term "chromatic" was used to determine the coordinates of diversification in terms of ...
Dionysios Politis, Dimitrios Margounakis
openaire   +1 more source

Subdivisions and the chromatic index of r‐graphs

Journal of Graph Theory, 1996
Let \(T_2\) be the graph obtained from the Petersen graph by first deleting a vertex and then contracting an edge incident to a vertex of degree two. We give a simple characterization of the graphs that contain no subdivision of \(T_2\). This characterization is used to show that if every planar \(r\)-graph is \(r\)-edge colorable, then every \(r ...
Kyriakos Kilakos, F. Bruce Shepherd
openaire   +2 more sources

On the Chromatic Index of Random Uniform Hypergraphs

SIAM Journal on Discrete Mathematics, 2015
Summary: Let \(\mathbb{H}^{(k)}(n, N)\), where \(k \geq 2\), be a random hypergraph on the vertex set \([n] = \{1, 2, \dots, n\}\) with \(N\) edges drawn independently with replacement from all subsets of \([n]\) of size \(k\). For \(\bar{d} = k N/n\) and any \(\varepsilon > 0\) we show that if \(k = o(\ln ({\bar d}/\ln n))\) and \(k = o(\ln (n/\ln ...
Valentas Kurauskas, Katarzyna Rybarczyk
openaire   +1 more source

The chromatic index of simple hypergraphs

Graphs and Combinatorics, 1986
A hypergraph \(H=(V,{\mathcal E})\) is called simple if \(| E\cap F| \leq 1\) holds for all pairs of distinct edges, E,F\(\in {\mathcal E}\). A matching in H is a collection of pairwise disjoint edges. The chromatic index of H, denoted by q(H) is the minimum number q such that one can decompose \({\mathcal E}\) into q matchings. The neighborhood of \(x\
openaire   +1 more source

Strong Chromatic Index of Sparse Graphs

Journal of Graph Theory, 2015
AbstractA coloring of the edges of a graph G is strong if each color class is an induced matching of G. The strong chromatic index of G, denoted by , is the least number of colors in a strong edge coloring of G. Chang and Narayanan (J Graph Theory 73(2) (2013), 119–126) proved recently that for a 2‐degenerate graph G.
Daqing Yang, Xuding Zhu
openaire   +2 more sources

A note on the line‐distinguishing chromatic number and the chromatic index of a graph

Journal of Graph Theory, 1993
AbstractLet λ(G) be the line‐distinguishing chromatic number and x′(G) the chromatic index of a graph G.We prove the relation λ(G) ≥ x′(G), conjectured by Harary and Plantholt. © 1993 John Wiley & Sons, Inc.
openaire   +2 more sources

Total-chromatic number and chromatic index of dually chordal graphs

Information Processing Letters, 1999
Abstract Given a graph G and a vertex v , a vertex u∈N(v) is a maximum neighbor of v if for all w∈N(v) we have N(w)⫅N(u) , where N(v) denotes the neighborhood of v in G . A maximum neighborhood elimination order of G is a linear order v 1 ,v 2 ,…,v n on its vertex set ...
Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello   +2 more
openaire   +1 more source