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

Almost every graph is vertex-oblique

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

DOI10.1016/J.DISC.2005.11.054zbMath1112.05096OpenAlexW2047008051MaRDI QIDQ868373

Jens Schreyer

Publication date: 2 March 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.054


zbMATH Keywords

asymmetric graphsoblique graphs


Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)


Related Items (2)

Generic case complexity of the graph isomorphism problem ⋮ Some properties of vertex-oblique graphs




Cites Work

  • Dually vertex-oblique graphs
  • Random Graph Isomorphism
  • Unnamed Item




This page was built for publication: Almost every graph is vertex-oblique

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