The number of labeled graphs placeable by a given permutation
From MaRDI portal
Publication:4862103
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199601)21:1<11::AID-JGT2>3.0.CO;2-P" /><11::AID-JGT2>3.0.CO;2-P 10.1002/(SICI)1097-0118(199601)21:1<11::AID-JGT2>3.0.CO;2-PzbMath0840.05030OpenAlexW2019360514MaRDI QIDQ4862103
Publication date: 4 July 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199601)21:1<11::aid-jgt2>3.0.co;2-p
Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
This page was built for publication: The number of labeled graphs placeable by a given permutation