Skip to content
VuFind
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
    • 日本語
    • Nederlands
    • Português
    • Português (Brasil)
    • 中文(简体)
    • 中文(繁體)
    • Türkçe
    • עברית
    • Gaeilge
    • Cymraeg
    • Ελληνικά
    • Català
    • Euskara
    • Русский
    • Čeština
    • Suomi
    • Svenska
    • polski
    • Dansk
    • slovenščina
    • اللغة العربية
    • বাংলা
    • Galego
    • Tiếng Việt
    • Hrvatski
    • हिंदी
    • Հայերէն
    • Українська
    • Sámegiella
    • Монгол
Advanced
  • Adjoint functors and tree dual...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
Adjoint functors and tree duality

Adjoint functors and tree duality

Graphs and Algorithms

Bibliographic Details
Main Authors: Jan Foniok, Claude Tardif
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2009-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:https://dmtcs.episciences.org/458/pdf
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

https://dmtcs.episciences.org/458/pdf

Similar Items

  • Digital search trees with m trees: Level polynomials and insertion costs
    by: Helmut Prodinger
    Published: (2011-08-01)
  • On the Book Thickness of k-Trees
    by: Vida Dujmović, et al.
    Published: (2011-10-01)
  • The Laplacian spread of a tree
    by: Yi-Zheng Fan, et al.
    Published: (2008-01-01)
  • The Variance of the Profile in Digital Search Trees
    by: Ramin Kazemi, et al.
    Published: (2011-09-01)
  • On the kth Eigenvalues of Trees with Perfect Matchings
    by: An Chang, et al.
    Published: (2007-01-01)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs