Cites work
- scientific article; zbMATH DE number 3172312 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3297027 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- scientific article; zbMATH DE number 3339023 (Why is no real title available?)
- scientific article; zbMATH DE number 3345462 (Why is no real title available?)
- scientific article; zbMATH DE number 3390793 (Why is no real title available?)
- scientific article; zbMATH DE number 3402664 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- A Note on "The Comparability Graph of a Tree"
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- An Introduction to Matroid Theory
- An interval graph is not a comparability graph
- Enumeration of vacuously transitive relations
- Flots et tensions dans un graphe
- Graphs and partial orderings
- Partially Ordered Sets
- Partially ordered sets and their comparability graphs
- Permutation Graphs and Transitive Graphs
- Representation of a finite graph by a set of intervals on the real line
- Segment-Preserving Maps of Partial Orders
- The complexity of comparability graph recognition and coloring
- Transitiv orientierbare Graphen
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- Triangulated graphs and the elimination process
- Uniquely Partially Orderable Graphs
Cited in
(24)- Chronological orderings of interval graphs
- Partitioned probe comparability graphs
- Recognizing interval digraphs and interval bigraphs in polynomial time
- A note on perfect Gaussian elimination
- The homogeneous set sandwich problem
- Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks
- On incomplete preference structures
- New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
- Constructing a stochastic critical path network given the slacks: Representation
- Comparability graphs with constraint, partial semi-orders and interval orders
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
- An algorithm for generating all maximal independent subsets of posets
- The complexity of comparability graph recognition and coloring
- \(P_ 4\)-trees and substitution decomposition
- On realizable biorders and the biorder dimension of a relation
- On finding the jump number of a partial order by substitution decomposition
- On the X-join decomposition for undirected graphs
- Containment graphs and posets of paths in a tree: wheels and partial wheels
- An algorithm for finding homogeneous pairs
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Partitive hypergraphs
- The stochastic 2-binary choice problem
- New results on induced matchings
This page was built for publication: Comparability graphs and a new matroid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1235707)
