Results 271 to 280 of about 10,769 (289)

Strong chromatic index of subset graphs

Journal of Graph Theory, 1997
A coloring of the edges of a graph is called a strong edge coloring if the edges in each color form an induced matching. The strong chromatic index \(sq(G)\) of a graph \(G\) is the smallest number of colors in any strong coloring. A conjecture of Brualdi and Quinn states that if \(G\) is a bipartite graphs, with parts \(X\) and \(Y\), then \(sq(G)\leq\
Quinn, Jennifer J., Benjamin, Arthur T.
openaire   +2 more sources

Chromatic Index and Resolvability

1999
Abstract Determining the size of a maximum PPC in an arbitrary TS(v, λ.)appears to be a more difficult question. The first nontrivial bound on the size of a maximum PPC in STSs was established by Lindner and Phelps (1978); it says that every STS(v) contains a PPC of size at least (v−1)/4 for vsufficiently large.
Charles J Colbourn, Alexander Rosa
openaire   +1 more source

Visualizing the chromatic index of music

Proceedings of the Fourth International Conference onWeb Delivering of Music, 2004. EDELMUSIC 2004., 2004
Dionysios Politis, Dimitrios Margounakis, Konstantinos Mokos   +2 more
openaire   +1 more source

Computing the list chromatic index of graphs

Journal of Discrete Algorithms, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On the density, chromatic number and chromatic index of a graph

1991
Bounds on the chromatic number of a graph in terms of its density are surveyed. The concepts of line-graph and of chromatic index are exploited. In turn, a sharpening of Vizing's Theorem ls exhibited. Additional conditions yield the chromatic class of the Generalized Petersen Graphs and of certain uniquely colourable graphs.
Fiorini S., LO FARO, Giovanni, PUCCIO, Luigia   +2 more
openaire   +1 more source

On the chromatic index and the cover index of a multigraph

1978
The problem of determining bounds for the chromatics index and the cover index of a multigraph is considered. Results stated include (I) a bound for the cover index which is analogous to the well-known bound for the chromatic index due to Shannon, (II) a bound for the chromatic index (and analogous bound for the cover index) which establishes ...
openaire   +1 more source

On the chromatic index of a graph, II.

1974
Fiorini, Stanley, Wilson, Robin J.
openaire   +2 more sources

On the harmonic index and the chromatic number of a graph

Discrete Applied Mathematics, 2013
Hanyuan Deng, S K Ayyaswamy
exaly  

Edge-partition and star chromatic index

Applied Mathematics and Computation, 2018
Weifan Wang, Yiqiao Wang
exaly  

The game chromatic index of forests of maximum degree

Discrete Applied Mathematics, 2006
Stephan Dominique Andres
exaly