Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A class of graphs each tolerance graph of which is a bounded one

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

DOI10.1007/BF02940779zbMath0818.05051MaRDI QIDQ1341250

Andreas Parra

Publication date: 24 January 1995

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)


zbMATH Keywords

comparability graphinterval graphtolerance graph


Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)


Related Items (1)

On the intersection of tolerance and cocomparability graphs



Cites Work

  • On a problem concerning tolerance graphs
  • Tolerance graphs
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: A class of graphs each tolerance graph of which is a bounded one

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1341250&oldid=13474607"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki