On interval graphs and matrice profiles

DOI10.1051/RO/1986200302451MaRDI QIDQ3744204zbMATH OpenOpenAlexFDO

Authors Alain Billionnet

Publication date 1986

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/104904

zbMATH Keywords

chronological orderingsinterval graphmatrix profileNP-completenessoptimization

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• Chronological orderings of interval graphs
• Interval Completion Is Fixed Parameter Tractable
• A matrix characterization of interval and proper interval graphs
• On a complementary interval graph with the lowest max-degree
• Interval graph representation with given interval and intersection lengths

Cited in

(6)

• Parameterizing above or below guaranteed values
• On the profile of the corona of two graphs
• Interval degree and bandwidth of a graph
• On tradeoffs between width- and fill-like graph parameters
• A matrix characterization of interval and proper interval graphs
• Fixed-parameter complexity of minimum profile problems

This page was built for publication: On interval graphs and matrice profiles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3744204)