Imagen de Portada

The $(\leq 6)$-half-reconstructibility of digraphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Salem, Baraa, Dammak, Jamel
Formato:	Preprint
Publicado:	2013
Materias:	Combinatorics 05C60
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Maximising homomorphism counts between digraphs
por: Lüchtrath, Lukas, et al.
Publicado: (2026)

On the class reconstruction number of trees
por: Krasikov, Ilia, et al.
Publicado: (2023)

Recognizing bicoset digraphs which are $X$-joins and automorphism groups of bicoset digraphs
por: Barber, Rachel, et al.
Publicado: (2024)

Spectral measure for uniform $d$-regular digraphs
por: Adhikari, Arka, et al.
Publicado: (2023)

On CI-property of normal Cayley digraphs over abelian groups
por: Ryabov, Grigory
Publicado: (2025)

On the reconstruction of trees from their chromatic symmetric functions
por: Gonzalez, Michael, et al.
Publicado: (2025)

Caterpillars with $n$ vertices are reconstructible from subgraphs with at most $n/2+1$ vertices
por: Kostochka, Alexandr V., et al.
Publicado: (2025)

The largest common subtree of two random trees
por: Angel, Omer, et al.
Publicado: (2025)

Bell coloring graphs: realizability and reconstruction
por: Asgarli, Shamil, et al.
Publicado: (2025)

Fringe trees of Patricia tries, compressed binary search trees, and three other random full binary trees
por: Janson, Svante
Publicado: (2024)

Asymptotics for the harmonic descent chain and applications to critical beta-splitting trees
por: Brandenberger, Anna, et al.
Publicado: (2025)

Tight universal bounds on the height times the width of random trees
por: Donderwinkel, Serte, et al.
Publicado: (2024)

Critical trees are neither too short nor too fat
por: Addario-Berry, Louigi, et al.
Publicado: (2023)

A study on Type-2 isomorphic circulant graphs. Part 6: Abelian groups $(T2_{n,m}(C_n(R)), \circ)$ and $(V_{n,m}(C_n(R)), \circ)$
por: Kamalappan, Vilfred
Publicado: (2026)

Note on a Coin Tossing Problem Posed by Daniel Litt
por: Levin, Bruce
Publicado: (2024)

Proof of a combinatorial conjecture posed in "The Blimpy Shape of Heady-s and Taily-s Bit Strings"
por: Levin, Bruce
Publicado: (2025)

Countable homogeneous ordered bipartite graphs
por: Truss, J. K.
Publicado: (2024)

When will (game) wars end?
por: Bhatia, Manan, et al.
Publicado: (2023)

Random Domino Tilings and the Arctic Circle Theorem
por: Jockusch, William, et al.
Publicado: (1998)

Logical aspects of isomorphism of controllable graphs and cospectrality of distance-regularized graphs
por: Abiad, Aida, et al.
Publicado: (2026)

Leaper Embeddings
por: Beluhov, Nikolai
Publicado: (2025)

Strong coalitions in graphs
por: Golmohammadi, Hamidreza, et al.
Publicado: (2024)

Central limit theorem for crossings in randomly embedded graphs
por: Arenas-Velilla, Santiago, et al.
Publicado: (2023)

Central limit theorem for components in meandric systems through high moments
por: Janson, Svante, et al.
Publicado: (2023)

Limit distributions for cycles of random parking functions
por: Paguyo, J. E., et al.
Publicado: (2025)

Paired domination in trees: A linear algorithm and asymptotic normality
por: Henning, Michael A., et al.
Publicado: (2025)

On identity Seidel switches
por: Gervacio, Severino V.
Publicado: (2026)

Reconstruction of C_4-free graphs from the set of closed neighborhoods and digital convexity
por: Borgwardt, Steffen, et al.
Publicado: (2025)

Bound for the energy of graphs in terms of degrees and leaves
por: Arizmendi, Octavio, et al.
Publicado: (2025)

Packing subdivisions into regular graphs
por: Montgomery, Richard, et al.
Publicado: (2025)

Homomorphic Preimages of Geometric Cycles
por: Cockburn, Sally
Publicado: (2015)

Graph isomorphism and multivariate graph spectrum
por: Wang, Wei, et al.
Publicado: (2024)

Fair coalition in graphs
por: Alikhani, Saeid, et al.
Publicado: (2025)

On Oriented Colourings of Graphs on Surfaces
por: Clow, Alexander
Publicado: (2024)

Counting records in a random, non-uniform, permutation
por: Pittel, Boris
Publicado: (2025)

A note on the distribution of the sum of lengths of the initial longest increasing sequences in cycles of random permutations
por: Mutafchiev, Ljuben
Publicado: (2025)

The sharp threshold for jigsaw percolation in random graphs
por: Cooley, Oliver, et al.
Publicado: (2018)

Monochromatic Subgraphs in Randomly Colored Dense Multiplex Networks
por: Andrade, Mauricio Daros, et al.
Publicado: (2025)

Large expander subgraphs in high genus triangulations
por: Lions, Tanguy, et al.
Publicado: (2026)

Reconstruction of caterpillar tanglegrams
por: Clifton, Ann, et al.
Publicado: (2025)