Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs

Journal of Graph Theory

Volumn 47, Issue 2, 2004, Pages 122-128

  Pyatkin, A V ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

Biregular bipartite graph; Interval coloring

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

BIREGULAR BIPARTITE GRAPH; INTERVAL COLORING;

GRAPH THEORY;

EID: 4644367944     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.20021     Document Type: Article

References (10)

1. A. S. Asratian and R. R. Kamalian, Interval coloring of the edges of a multigraph (in Russian). Applied Mathematics 5, Erevan University, 1987 (Armenian summary), pp. 25-34.
2. A. S. Asratian and R. R. Kamalian, Investigation on interval edge-coloring of graphs, J Combin Theory B 62 (1994), 34-43.
3. M. R. Garey and D. S. Johnson, Computers and intractability, A guide to the theory of NP-completeness, New York; W. H. Freeman and Company, 1979.
4. K. Giaro, The complexity of consecutive Δ-coloring of bipartite graphs: 4 is easy, 5 is hard, Ars Combinatoria 47 (1997), 287-298.
5. K. Giaro, Compact task scheduling on dedicated processors with no waiting period (in Polish). PhD thesis, Technical University of Gdansk, IETI Faculty, Gdansk, 1999.
6. K. Giaro, M. Kubale, and M. Malafiejski, On the deficiency of bipartite graphs, Discre Appl Math 94 (1999), 193-203.
7. H. M. Hansen, Scheduling with minimum waiting periods (in Danish), Master Thesis, Odense University, Odense, Denmark, 1992.
8. D. Hanson, C. O. M. Loten, and B. Toft, On interval coloring of biregular bipartite graphs, Ars Combinatoria 50 (1998), 23-32.
9. T. R. Jensen and B. Toft, Graph coloring problems, John Wiley & Sons, USA: 1995.
10. S. V. Sevast'janov, Interval colorability of the edges of a bipartite graph (in Russian), Metody Diskremogo Analiza, IM SO RAN summary, No. 50, Novosibirsk, 1990, pp. 61-72.