Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

An interval graph is a comparability graph

From MaRDI portal
Publication:5574693
Jump to:navigation, search

DOI10.1016/S0021-9800(69)80056-6zbMATH Open0183.28603OpenAlexW2023339774MaRDI QIDQ5574693FDOQ5574693


Authors: Michel Jean Edit this on Wikidata


Publication date: 1969

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0021-9800(69)80056-6





zbMATH Keywords

topology



Cited In (5)

  • Hereditary classes of graphs: a parametric approach
  • Boundary properties of graphs for algorithmic graph problems
  • Minimal classes of graphs of unbounded clique-width
  • Critical properties and complexity measures of read-once Boolean functions
  • Testing superperfection of k-trees





This page was built for publication: An interval graph is a comparability graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5574693)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5574693&oldid=30195669"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 March 2024, at 03:42. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki