Back to search

Comparability graphs and a new matroid

Data up to Jan 2025

Published1977
Citations57
References25

Total Citations Per Year

Abstract

References (25)

Partially Ordered Sets

1941 • 935 citations

Transitiv orientierbare Graphen

1967 • 872 citations

Representation of a finite graph by a set of intervals on the real line

1962 • 737 citations

A Characterization of Comparability Graphs and of Interval Graphs

1964 • 607 citations

Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

1972 • 536 citations

Triangulated graphs and the elimination process

1970 • 496 citations

Proof Techniques in Graph Theory

1970 • 399 citations

Transitive Orientation of Graphs and Identification of Permutation Graphs

1971 • 259 citations

Permutation Graphs and Transitive Graphs

1972 • 180 citations

The Many Facets of Graph Theory

1969 • 124 citations

A note on “The comparability graph of a tree”

1965 • 118 citations

Graph Theory and Applications

1972 • 99 citations

Recent Trends in Graph Theory

1971 • 53 citations

An Introduction to Matroid Theory

1973 • 47 citations

To the undimmed memory of petr Grigor'evich Kontorovich: Partially ordered sets and their comparability graphs

1970 • 34 citations

An Introduction to Matroid Theory

1973 • 25 citations

Uniquely Partially Orderable Graphs

1971 • 16 citations

An interval graph is not a comparability graph

1970 • 12 citations

Graphs of (0,1)-matrices

1971 • 9 citations

Graphs and partial orderings

1969 • 8 citations

The strong perfect graph conjecture and an application to a municipal routing problem

1972 • 4 citations

Enumeration of vacuously transitive relations

1973 • 4 citations

Graphs and binary relations

1969 • 3 citations

Segment-Preserving Maps of Partial Orders

1972 • 1 citations

Segment-preserving maps of partial orders

1972 • 1 citations

Cited By (0)

Loading...