Minimum proper interval graphs

DOI10.1016/0012-365X(95)00007-JzbMATH Open0828.05053MaRDI QIDQ1896346FDOQ1896346

Authors: Yanyan Li 

Publication date: 18 December 1995

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

Recommendations

• Closed graphs are proper interval graphs
• Metric characterizations of proper interval graphs and tree-clique graphs
• Interval Graphs with Containment Restrictions
• Minimal proper interval completions
• Minimal Proper Interval Completions

zbMATH Keywords

intervalenumerationcharacterizationproper interval graphclique graphnumber of cliquesgreatest clique-closed class

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)

Cites Work

• On the compatibility between a graph and a simple order
• Parallel concepts in graph theory
• Clique graphs of time graphs
• On time graphs
• On nontransitive indifference

Cited In (4)

• Closed graphs are proper interval graphs
• Metric characterizations of proper interval graphs and tree-clique graphs
• Decompositions for the edge colouring of reduced indifference graphs.
• Biclique graphs of split graphs

This page was built for publication: Minimum proper interval graphs

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