Split orders

DOI10.1016/S0012-365X(03)00313-3MaRDI QIDQ1422429zbMATH OpenOpenAlexFDO

Authors Glen-Brug Guenver, Jean-Xavier Rampon

Publication date 14 February 2004

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(03)00313-3

zbMATH Keywords

AlgorithmDimensionDirected graphIsomorphismPartially ordered setSplit graphSplit order

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Split orders
• Split semiorders
• Dimensions of split semiorders
• Counting split intervals orders
• Linear recognition of pseudo-split graphs

Cites work

• A linear-time recognition algorithm for interval dags
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Cycle-free partial orders and chordal comparability graphs
• scientific article; zbMATH DE number 3877239 (Why is no real title available?)
• scientific article; zbMATH DE number 53952 (Why is no real title available?)
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• scientific article; zbMATH DE number 3245483 (Why is no real title available?)
• Minimizing Setups for Cycle-Free Ordered Sets
• Partial orders and their convex subsets
• The dimension of cycle-free orders
• The splittance of a graph
• Transitiv orientierbare Graphen

Cited in

(7)

• Dimensions of split semiorders
• Split semiorders
• Recent results on containment graphs of paths in a tree
• Segment orders
• Split orders
• A separation decomposition for orders
• Chain dominated orders

This page was built for publication: Split orders

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