Completing colored graphs to meet a target property
type: Item
instance of: scholarly article
title: Completing colored graphs to meet a target property
zbMATH Open document ID: 1464.05147
author: Kathryn Cook
author: Elaine M. Eschen
author: R. Sritharan
author: Xiaoqiang Wang
published in: Discrete Applied Mathematics
publication date: 2021-06-07T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7355966
zbMATH Keywords: completion problem
zbMATH Keywords: sandwich problem
zbMATH Keywords: chordal graph
zbMATH Keywords: strongly chordal graph
zbMATH Keywords: circular-arc graph
MaRDI profile type: Publication
full work available at URL: j.dam.2017.01.021
OpenAlex ID: W2593122855
cites work: The hardness of intervalizing four colored caterpillars
cites work: On the proper intervalization of colored caterpillar trees
cites work: On intervalizing \(k\)-colored graphs for DNA physical mapping
cites work: The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
cites work: Two strikes against perfect phylogeny
cites work: A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs
cites work: On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
cites work: On rigid circuit graphs
cites work: Polynomial time recognition of unit circular-arc graphs
cites work: Q4198056
cites work: Algorithms on circular-arc graphs
cites work: Graph Sandwich Problems
cites work: Q4201932
cites work: Triangulating Three-Colored Graphs in Linear Time and Linear Space
cites work: Triangulating 3-Colored Graphs
cites work: Proper Helly Circular-Arc Graphs
cites work: The clique operator on circular-arc graphs
cites work: Normal Helly circular-arc graphs and its subclasses
cites work: Algorithms finding tree-decompositions of graphs
cites work: Triangulating Vertex-Colored Graphs
cites work: Q5588432
cites work: Chordal bipartite completion of colored graphs
cites work: Matrix characterizations of circular-arc graphs
cites work: Structure theorems for some circular-arc graphs
cites work: An Efficient Test for Circular-Arc Graphs
DOI: 10.1016/J.DAM.2017.01.021
description: scientific article; zbMATH DE number 7355966