A type of algebraic structure related to sets of intervals

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Primitive bound of a 2-structure
Tree-representation of set families and applications to combinatorial decompositions
A new characterization of matrices with the consecutive ones property
Algorithmic aspects of intersection graphs and representation hypergraphs
Partitive hypergraphs
Characterization problems for graphs, partially ordered sets, lattices, and families of sets
Interval hypergraphs and D-interval hypergraphs
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Algorithmic characterizations of interval orderd hypergraphs and applications
Efficient graph representations
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
On interval clutters
Algorithmic graph theory and perfect graphs
Right-orderability versus left-orderability for monoids
The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
A structure theorem for the consecutive 1's property
Parallel recognition of the consecutive ones property with applications
Introduction to Boolean Algebras
L'ensemble des Intervalles d'une Multirelation Binaire et Reflexive
Faithful Representation of a Family of Sets by a Set of Intervals
Graph Classes: A Survey
On interval decomposition lattices
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
Transitiv orientierbare Graphen
Maximum matching in a convex bipartite graph
Carathéodory, Helly, and Radon Numbers for Sublattice and Related Convexities
A textbook of graph theory
Graph-Theoretic Concepts in Computer Science

This page was built for publication: A type of algebraic structure related to sets of intervals