Template-Driven Rainbow Coloring of Proper Interval Graphs

[1]  Theodore Molla,et al.  Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs , 2017, Eur. J. Comb..

[2]  He Chen,et al.  Long rainbow paths and rainbow cycles in edge colored graphs - A survey , 2018, Appl. Math. Comput..

[3]  Paul D. Seymour,et al.  Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths , 2017, Electron. J. Comb..

[4]  Gábor N. Sárközy,et al.  Induced Colorful Trees and Paths in Large Chromatic Graphs , 2016, Electron. J. Comb..

[5]  Xueliang Li,et al.  Rainbow Connections of Graphs: A Survey , 2011, Graphs Comb..

[6]  Alexandr V. Kostochka,et al.  Large Rainbow Matchings in Edge-Coloured Graphs , 2012, Comb. Probab. Comput..

[7]  Douglas B. West,et al.  Rainbow Matching in Edge-Colored Graphs , 2010, Electron. J. Comb..

[8]  Florica Kramer,et al.  A survey on the distance-colouring of graphs , 2008, Discret. Math..

[9]  Sajal K. Das,et al.  Conflict-free star-access in parallel memory systems , 2006, J. Parallel Distributed Comput..

[10]  M. Golumbic.  Chapter 3 - Perfect graphs , 2004 .

[11]  Bhawani Sankar Panda,et al.  A linear time recognition algorithm for proper interval graphs , 2003, Inf. Process. Lett..

[12]  Alan A. Bertossi,et al.  Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees , 2002, J. Parallel Distributed Comput..

[13]  Sajal K. Das,et al.  Optimal Mappings of q-ary and Binomial Trees into Parallel Memory Modules for Fast and Conflict-Free Access to Path and Subtree Templates , 2000, J. Parallel Distributed Comput..

[14]  Jan Arne Telle,et al.  Classes of graphs with restricted interval models , 1999, Discret. Math. Theor. Comput. Sci..

[15]  Sajal K. Das,et al.  Conflict-Free Access to Templates of Trees and Hypercubes in Parallel Memory Systems , 1997, COCOON.

[16]  Xiaotie Deng,et al.  Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs , 1996, SIAM J. Comput..

[17]  Stephan Olariu,et al.  Simple Linear Time Recognition of Unit Interval Graphs , 1995, Inf. Process. Lett..

[18]  S. Olariu,et al.  Optimal greedy algorithms for indifference graphs , 1992, Proceedings IEEE Southeastcon '92.