Tree loop graphs

DOI10.1016/j.dam.2005.01.001zbMath1113.05024OpenAlexW2073986561MaRDI QIDQ876466

Liliana Alcón, Márcia R. Cerioli, João Meidanis, Marisa Gutierrez, Celina M. Herrera de Figueiredo

Publication date: 18 April 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://sedici.unlp.edu.ar/handle/10915/82964

zbMATH Keywords

DNA physical mappinginterval graphsinterval numbercomputational molecular biologyDNA fragment assembly problem

Mathematics Subject Classification ID

Trees (05C05) Biochemistry, molecular biology (92C40) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Recognizing \(d\)-interval graphs and \(d\)-track interval graphs ⋮ On the parameterized complexity of some optimization problems related to multiple-interval graphs ⋮ Structural results on circular-arc graphs and circle graphs: a survey and the main open problems ⋮ Convex and isometric domination of (weak) dominating pair graphs

Cites Work

• Unnamed Item
• Recognizing graphs with fixed interval number is NP-complete
• The interval number of a planar graph: Three intervals suffice
• Incidence matrices and interval graphs
• On double and multiple interval graphs
• Representation of a finite graph by a set of intervals on the real line
• An Efficient Test for Circular-Arc Graphs
• A Characterization of Comparability Graphs and of Interval Graphs
• On the structure of graphs with bounded asteroidal number

This page was built for publication: Tree loop graphs