Representation theorems for graphs whose vertex set is partially ordered

DOI10.1016/0012-365X(85)90143-8zbMATH Open0557.05056MaRDI QIDQ762181FDOQ762181

Authors: Alain Quilliot 

Publication date: 1985

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

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

zbMATH Keywords

graphsinterval graphspartial orderhypergraphcircular graphs

Mathematics Subject Classification ID

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

Cites Work

• Representation of a finite graph by a set of intervals on the real line
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Structure theorems for some circular-arc graphs
• Title not available (Why is that?)

Cited In (3)

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

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)