Carregant...
Carregant...

Vés al contingut (premeu Retorn)

New large graphs with given degree and diameter

Autor
Comellas, F.; Gomez, J.
Tipus d'activitat
Capítol de llibre
Llibre
Graph theory, combinatorics and applications: proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs
Pàgina inicial
221
Pàgina final
233
Editorial
Wiley
Data de publicació
1995-06
ISBN
0-471-30437-9 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/116374 Obrir en finestra nova
Resum
Let G be a (simple) graph with maximum degree three and chromatic index four. A 3-edge-coloring of G is a coloring of its edges in which only three colors are used. Then a vertex is conflicting when some edges incident to it have the same color. The minimum possible number of conflicting vertices that a 3- edge-coloring of G can have, d(G), is called the edge-coloring degree of G. Here we are mainly interested in the structure of a graph G with given edge-coloring degree and, in particular, when...
Citació
Fiol, M. c-Critical graphs with maximum degree three. A: "Graph theory, combinatorics and applications: proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs". Wiley, 1995, p. 403-411.
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants