On the number of factors in codings of three interval exchange

On the number of factors in codings of three interval exchange

Graph Theory

Bibliographic Details
Main Authors:	Petr Ambrož, Anna Frid, Zuzana Masáková, Edita Pelantová
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2011-11-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/553/pdf

Similar Items

Addition and multiplication of beta-expansions in generalized Tribonacci base
by: Petr Ambrož, et al.
Published: (2007-01-01)

Ambiguity in the m-bonacci numeration system
by: Petra Kocábová, et al.
Published: (2007-01-01)

Infinite special branches in words associated with beta-expansions
by: Christiane Frougny, et al.
Published: (2007-01-01)

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

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

Coding partitions
by: Fabio Burderi, et al.
Published: (2007-01-01)

The determining number of Kneser graphs
by: José Cáceres, et al.
Published: (2013-01-01)

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

The resolving number of a graph Delia
by: Delia Garijo, et al.
Published: (2013-12-01)

The b-chromatic number of powers of cycles
by: Anja Kohl
Published: (2013-03-01)

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

On-line Ramsey numbers for paths and stars
by: J. A. Grytczuk, et al.
Published: (2008-01-01)

On the minimal distance of a polynomial code
by: Peter Pal Pach, et al.
Published: (2011-11-01)

On quadratic residue codes and hyperelliptic curves
by: David Joyner
Published: (2008-01-01)

Gray code order for Lyndon words
by: Vincent Vajnovszki
Published: (2007-01-01)

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

A lower bound for approximating the Grundy number
by: Guy Kortsarz
Published: (2007-01-01)

On the number of maximal independent sets in a graph
by: David R. Wood
Published: (2011-09-01)

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

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

Computation of L_⊕ for several cubic Pisot numbers
by: Julien Bernat
Published: (2007-01-01)

Secure frameproof codes through biclique covers
by: Hossein Hajiabolhassan, et al.
Published: (2012-12-01)

A bound on the number of perfect matchings in Klee-graphs
by: Marek Cygan, et al.
Published: (2013-01-01)

The competition number of a generalized line graph is at most two
by: Boram Park, et al.
Published: (2012-08-01)

Bounded-degree graphs have arbitrarily large queue-number
by: David R. Wood
Published: (2008-01-01)

Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System
by: Valerie Berthe, et al.
Published: (2009-03-01)

Computing the number of h-edge spanning forests in complete bipartite graphs
by: Rebecca Stones
Published: (2014-05-01)

A note on planar Ramsey numbers for a triangle versus wheels
by: Guofei Zhou, et al.
Published: (2012-11-01)

A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
by: David Callan
Published: (2008-01-01)

On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet
by: Nicolas Bédaride, et al.
Published: (2010-01-01)

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

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

A Note on t-designs with t Intersection Numbers
by: Rajendra M. Pawale
Published: (2004-01-01)

On the residual solvability of generalized free products of solvable groups
by: Delaram Kahrobaei, et al.
Published: (2011-11-01)

The extended equivalence and equation solvability problems for groups
by: Gabor Horvath, et al.
Published: (2011-11-01)

Computing tensor decompositions of finite matrix groups
by: Nurullah Ankaralioglu, et al.
Published: (2011-11-01)

Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem
by: Thomas P. Hayes
Published: (2011-11-01)

On the complexity of vertex-coloring edge-weightings
by: Andrzej Dudek, et al.
Published: (2011-11-01)

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

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