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

scientific article

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

zbMath0558.05059MaRDI QIDQ3222890

Ivan Rival

Publication date: 1985


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

comparability graphsordered setsdiagramscovering graphs


Mathematics Subject Classification ID

Partial orders, general (06A06) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05C99)


Related Items

Characterization of diagrams by 0-1 inequalities ⋮ Inversions, cuts, and orientations ⋮ Orders with level diagrams ⋮ A non-covering graph of girth six ⋮ The complexity of cover graph recognition for some varieties of finite lattices ⋮ Non-cover generalized Mycielski, Kneser, and Schrijver graphs ⋮ Products of abstract polytopes ⋮ Lattices contained in planar orders are planar ⋮ A note on optimal area algorithms for upward drawings of binary trees ⋮ Stability of regional orthomodular posets under synchronisation and refinement ⋮ M-chain graphs of posets ⋮ Obituary: Ivan Rival ⋮ Enumerating orientations of ordered sets ⋮ Strict refinement for graphs and digraphs



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