On interval colourings of bi-regular bipartite graphs

Ars Combinatoria

Volumn 50, Issue , 1998, Pages 23-32

  Hanson, D ^a   Loten, C O M ^a   Toft, B ^b  

^a UNIVERSITY OF REGINA   (Canada)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032425432     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. A.S. Asratian and R.R. Kamalian, Interval colorings of the edges of a multigraph (in Russian), Applied Mathematics, No. 5, Erevan University, Erevan, 1987 (Armenian summary), 25-34 and 130-131.
2. A.S. Asratian and R.R. Kamalian, Investigation on interval edge-colorings of graphs, J. of Combinatorial Theory B 62 (1994), 34-43.
3. F. Bäbler, Über die Zerlegung regulärer Streckenkomplexe ungerader Ordnung, Comment. Mat. Helvetici 10 (1938), 275-287.
4. H.M. Hansen, Scheduling with minimum waiting periods (in Danish), Masters Thesis, Odense University, Odense, Denmark, 1992.
5. T.R. Jensen and B. Toft, Graph Coloring Problems, Wiley Interscience Series in Discrete Mathematics and Optimization, 1995.
6. D. König, Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre, Math. Ann. 77 (1916), 453-465.
7. J. Petersen, Die Theorie der regulären graphs, Acta Math. 15 (1891), 193-220.
8. S.V. Sevast'janov, Interval colorability of the edges of a bipartite graph (in Russian), Metody Diskret. Analiz 50 (1990), 61-72, 86.
9. W.T. Tutte, The factors of graphs, Canadian Journal of Math. 4 (1952), 314-328.