Publications
Preprints
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
Information for reviewers
Review process
How to peer review
Peer review policy
Register Dashboard
Search

Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen

Register Dashboard
Search
22
views
106
references
 Top references
cited by
7
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      3,829
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Graphs and Order 

      Algorithmic Aspects of Comparability Graphs and Interval Graphs

      other
      Author(s):
      Publication date (Print):
      Publisher: Springer Netherlands

      Read this book at

      Publisher
      Buy book
      Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references106

          • Record: found
          • Abstract: not found
          • Article: not found

          The ellipsoid method and its consequences in combinatorial optimization

          M. Grötschel, L Lovász, A Schrijver (1981)
          Article 0 comments Cited 262 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

            Kellogg S. Booth, George S. Lueker (1976)
            Article 0 comments Cited 192 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Incidence matrices and interval graphs

              Delbert Fulkerson, Oliver Gross (1965)
              Article 0 comments Cited 172 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 1985
                Pages: 41-101
                DOI: 10.1007/978-94-009-5315-4_2
                SO-VID: 9e97ee82-8ba7-46ba-830d-4b66524d091a
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content3,829

                See all similar

                Cited by7

                See all cited by