Completing colored graphs to meet a target property
- 1 May 2017
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 223, 39-51
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- On the proper intervalization of colored caterpillar treesRAIRO - Theoretical Informatics and Applications, 2009
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphsTheoretical Computer Science, 2007
- Polynomial time recognition of unit circular-arc graphsJournal of Algorithms, 2006
- The hardness of intervalizing four colored caterpillarsDiscrete Mathematics, 2001
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphsTheoretical Computer Science, 2000
- On intervalizing k-colored graphs for DNA physical mappingDiscrete Applied Mathematics, 1996
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval GraphsSIAM Journal on Computing, 1996
- A Simple Linear Time Algorithm for Triangulating Three-Colored GraphsJournal of Algorithms, 1993
- Algorithms on circular‐arc graphsNetworks, 1974
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961