Results 281 to 290 of about 58,831 (310)
Some of the next articles are maybe not open access.
Chromatic Index and Resolvability
1999Abstract 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
Color indexing using chromatic invariant
Pattern Recognition, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kim, JY +3 more
openaire +2 more sources
The b-Chromatic Index of a Graph
Bulletin of the Malaysian Mathematical Sciences Society, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jakovac, Marko, Peterin, Iztok
openaire +2 more sources
Total-chromatic number and chromatic index of dually chordal graphs
Information Processing Letters, 1999Abstract 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 +2 more
openaire +1 more source
Subdivisions and the chromatic index of r‐graphs
Journal of Graph Theory, 1996Let \(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 ...
Kilakos, K., Shepherd, F. B.
openaire +2 more sources
The strong chromatic index ofC4-free graphs
Random Structures and Algorithms, 2000The strong chromatic index of a graph \(G\) is the minimum number of induced matchings which partition \(E(G)\). In 1985, Erdős and Nešetřil conjectured that the strong chromatic index of every graph of maximum degree \(\Delta\) is at most \((5/4)\Delta^2\). Using a probabilistic method the author proves an asymptotically better result for graphs which
openaire +2 more sources
Injective chromatic index of sparse graphs
Discrete Applied MathematicsA \(k\)-injective-edge coloring of a graph \(G\) is an assignment of colors, i.e. integers in \(\{1, 2, \ldots , k\}\), to the edges of \(G\) such that \(e_1\) and \(e_3\) receive distinct colors for any three consecutive edges \(e_1\), \(e_2\), \(e_3\) of a path or a 3-cycle. The smallest integer \(k\) such that \(G\) has an injective-edge coloring is
Bu, Yuehua +3 more
openaire +2 more sources
The chromatic index of simple hypergraphs
Graphs and Combinatorics, 1986A 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
Inclusion chromatic index of random graphs
Journal of Graph TheoryAbstractErdős and Wilson proved in 1977 that almost all graphs have chromatic index equal to their maximum degree. In 2001 Balister extended this result and proved that the same number of colours is almost always sufficient if we additionally demand the distinctness of the sets of colours incident with any two vertices.
Jakub Kwaśny, Jakub Przybyło
openaire +2 more sources
On the density, chromatic number and chromatic index of a graph
1991Bounds 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. +2 more
openaire +1 more source