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

Algorithms for generating labelled graphs with given degree

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

DOI10.1016/0377-0427(91)90117-3zbMath0743.68108OpenAlexW1973506607MaRDI QIDQ1184790

Joris Van der Jeugt, Veerle Fack

Publication date: 28 June 1992

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(91)90117-3


zbMATH Keywords

Young tableauxlabelled graphs


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)


Related Items (1)

Quantum field theory meets Hopf algebra



Cites Work

  • Four correspondences between graphs and generalized Young tableaux
  • Permutations, matrices, and generalized Young tableaux
  • Longest Increasing and Decreasing Subsequences
  • Theory and Application of Plane Partitions: Part 1
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Algorithms for generating labelled graphs with given degree

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1184790&oldid=12049156"
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 00:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki