Representation theorems for graphs whose vertex set is partially ordered

DOI10.1016/0012-365X(85)90143-8MaRDI QIDQ762181zbMATH OpenFDO

Authors Alain Quilliot

Publication date 1985

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

graphsinterval graphspartial orderhypergraphcircular graphs

Mathematics Subject Classification ID

Partial orders, general (06A06) Hypergraphs (05C65)

Recommendations

• On the problem of how to represent a graph taking into account an additional structure
• scientific article; zbMATH DE number 4103134
• scientific article; zbMATH DE number 4195994
• scientific article; zbMATH DE number 3972916
• Représentation de familles ordonnées d'intervalles et applications

Cites work

• scientific article; zbMATH DE number 3566474 (Why is no real title available?)
• scientific article; zbMATH DE number 3641484 (Why is no real title available?)
• scientific article; zbMATH DE number 3286813 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Representation of a finite graph by a set of intervals on the real line
• Structure theorems for some circular-arc graphs

Cited in

(3)

• Circular representation problem on hypergraphs
• On the problem of how to represent a graph taking into account an additional structure
• Two representations of finite ordered sets

This page was built for publication: Representation theorems for graphs whose vertex set is partially ordered

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