Split orders

DOI10.1016/S0012-365X(03)00313-3zbMath1031.05106OpenAlexW4213336425MaRDI QIDQ1422429

Jean-Xavier Rampon, Glen-Brug Guenver

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

AlgorithmSplit graphDimensionPartially ordered setIsomorphismDirected graphSplit order

Mathematics Subject Classification ID

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

Related Items (2)

Chain dominated orders ⋮ Recent results on containment graphs of paths in a tree

Cites Work

• A linear-time recognition algorithm for interval dags
• The splittance of a graph
• Cycle-free partial orders and chordal comparability graphs
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Partial orders and their convex subsets
• The dimension of cycle-free orders
• Minimizing Setups for Cycle-Free Ordered Sets
• Transitiv orientierbare Graphen
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Split orders