Characterisations of intersection graphs by vertex orderings

zbMATH Open1112.05091MaRDI QIDQ5487920FDOQ5487920

Authors: David R. Wood 

Publication date: 13 September 2006

Recommendations

• Vertex orderings of graphs: an overview
• A vertex ordering characterization of simple-triangle graphs
• Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
• Chronological orderings of interval graphs
• scientific article; zbMATH DE number 3974992

zbMATH Keywords

bandwidthwidth of edge

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (6)

• Ordered graphs and large bi-cliques in intersection graphs of curves
• Graph drawings with few slopes
• Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words
• Vertex orderings of graphs: an overview
• A vertex ordering characterization of simple-triangle graphs
• Characterizing intersection classes of graphs

This page was built for publication: Characterisations of intersection graphs by vertex orderings

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