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

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)

Clustered Spanning Tree - Conditions for Feasibility
by: Nili Guttmann-Beck, et al.
Published: (2019-08-01)

On the kth Eigenvalues of Trees with Perfect Matchings
by: An Chang, et al.
Published: (2007-01-01)

The Variance of the Profile in Digital Search Trees
by: Ramin Kazemi, et al.
Published: (2011-09-01)

Colouring the Square of the Cartesian Product of Trees
by: David R. Wood
Published: (2011-08-01)

String pattern avoidance in generalized non-crossing trees
by: Yidong Sun, et al.
Published: (2009-01-01)

Tree-width and large grid minors in planar graphs
by: Alexander Grigoriev
Published: (2011-02-01)

Structure of spanning trees on the two-dimensional Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2011-01-01)

Analysis of some parameters for random nodes in priority trees
by: Alois Panholzer
Published: (2008-01-01)

Note on the weighted internal path length of b-ary trees
by: Ludger Rüschendorf, et al.
Published: (2007-01-01)

Recurrence among trees with most numerous efficient dominating sets
by: Dorota Bród, et al.
Published: (2008-01-01)

On the complexity of the balanced vertex ordering problem
by: Jan Kára, et al.
Published: (2007-01-01)

Avoidance colourings for small nonclassical Ramsey numbers
by: Alewyn Petrus Burger, et al.
Published: (2011-07-01)

Generation of Cubic graphs
by: Gunnar Brinkmann, et al.
Published: (2011-07-01)

Parameterized Problems Related to Seidel's Switching
by: Eva Jelinkova, et al.
Published: (2011-05-01)

Self-complementing permutations of k-uniform hypergraphs
by: Artur Szymański, et al.
Published: (2009-01-01)

Edge condition for long cycles in bipartite graphs
by: Lech Adamus
Published: (2009-01-01)

Enumeration of words by the sum of differences between adjacent letters
by: Toufik Mansour
Published: (2009-01-01)

Gray codes avoiding matchings
by: Darko Dimitrov, et al.
Published: (2009-01-01)

On the chromatic number of some flip graphs
by: Ruy Fabila-Monroy, et al.
Published: (2009-01-01)

On economical set representations of graphs
by: Jing Kong, et al.
Published: (2009-01-01)

Independent sets in (P₆, diamond)-free graphs
by: Raffaele Mosca
Published: (2009-01-01)

Determinants of rational knots
by: Louis H. Kauffman, et al.
Published: (2009-01-01)

The distribution of ascents of size d or more in compositions
by: Charlotte Brennan, et al.
Published: (2009-01-01)

The Eulerian distribution on centrosymmetric involutions
by: Marilena Barnabei, et al.
Published: (2009-01-01)

On the length of shortest 2-collapsing words
by: Alessandra Cherubini, et al.
Published: (2009-01-01)

Number of connected spanning subgraphs on the Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2009-01-01)

Directed figure codes are decidable
by: Michal Kolarz, et al.
Published: (2009-01-01)

Ore and Erdős type conditions for long cycles in balanced bipartite graphs
by: Janusz Adamus, et al.
Published: (2009-01-01)

A construction of small regular bipartite graphs of girth 8
by: Camino Balbuena
Published: (2009-01-01)

Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
by: Gábor Bacsó, et al.
Published: (2009-01-01)

Asymptotic enumeration on self-similar graphs with two boundary vertices
by: Elmar Teufl, et al.
Published: (2009-01-01)

On-line extensible bin packing with unequal bin sizes
by: Deshi Ye, et al.
Published: (2009-01-01)

Centerpoint theorems for wedges
by: Jeff Erickson, et al.
Published: (2009-01-01)

Long cycles in hypercubes with distant faulty vertices
by: Petr Gregor, et al.
Published: (2009-01-01)

Detection number of bipartite graphs and cubic graphs
by: Frederic Havet, et al.
Published: (2014-12-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-03-01)

The Cerný conjecture for automata respecting intervals of a directed graph
by: Mariusz Grech, et al.
Published: (2013-11-01)