Add to ORKGSIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kiel / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
The List Edge Colouring Conjecture asserts that, given any multigraph G with chromatic index k and a...
A proper edge colouring of a graph G is neighbour-distinguishing provided that it distinguishes adja...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
Die vorliegenden Arbeit enthält Ergebnisse zu Kanten- und Totalfärbungen von Graphen sowie verschied...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN038690 / BLDSC - British Library D...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
AbstractAn edge-coloration theorem for bipartite graphs, announced in [4], is proved from which some...
A {simultaneous edge coloring of graph G is a set of proper edge colorings of G with a same color s...
AbstractIn this note we summarize some of the progress made recently by the author, A.G. Chetwynd an...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
International audienceSoon after his 1964 seminal paper on edge colouring, Vizing asked the followin...
Artículo de publicación ISIIt is shown that Halin graphs are -edge-choosable and that graphs of tree...
SIGLEAvailable from TIB Hannover: RR 8071(97-12) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - ...
SIGLETIB: RO 1829 (1985,34) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
The List Edge Colouring Conjecture asserts that, given any multigraph G with chromatic index k and a...
A proper edge colouring of a graph G is neighbour-distinguishing provided that it distinguishes adja...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
Die vorliegenden Arbeit enthält Ergebnisse zu Kanten- und Totalfärbungen von Graphen sowie verschied...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN038690 / BLDSC - British Library D...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
AbstractAn edge-coloration theorem for bipartite graphs, announced in [4], is proved from which some...
A {simultaneous edge coloring of graph G is a set of proper edge colorings of G with a same color s...
AbstractIn this note we summarize some of the progress made recently by the author, A.G. Chetwynd an...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
International audienceSoon after his 1964 seminal paper on edge colouring, Vizing asked the followin...
Artículo de publicación ISIIt is shown that Halin graphs are -edge-choosable and that graphs of tree...
SIGLEAvailable from TIB Hannover: RR 8071(97-12) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - ...
SIGLETIB: RO 1829 (1985,34) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
The List Edge Colouring Conjecture asserts that, given any multigraph G with chromatic index k and a...
A proper edge colouring of a graph G is neighbour-distinguishing provided that it distinguishes adja...