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

On uniquely intersectable graphs

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

DOI10.1016/S0012-365X(99)00043-6zbMath0944.05085MaRDI QIDQ1817570

N. V. R. Mahadev, Tao-Ming Wang

Publication date: 24 September 2000

Published in: Discrete Mathematics (Search for Journal in Brave)


zbMATH Keywords

intersection graphcharacterizationintersection numberrealization


Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)


Related Items (5)

Arboricity, \(h\)-index, and dynamic algorithms ⋮ Computing square roots of trivially perfect and threshold graphs ⋮ A generalization of Opsut's result on the competition numbers of line graphs ⋮ Unique intersectability of diamond-free graphs ⋮ Cube intersection concepts in median graphs






This page was built for publication: On uniquely intersectable graphs

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