Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Salem, Baraa, Dammak, Jamel
Format:	Preprint
Published:	2013
Subjects:	Combinatorics 05C60
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

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

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

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

Critical trees are neither too short nor too fat
by: Addario-Berry, Louigi, et al.
Published: (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)$
by: Kamalappan, Vilfred
Published: (2026)

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

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

Countable homogeneous ordered bipartite graphs
by: Truss, J. K.
Published: (2024)

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

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

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

Leaper Embeddings
by: Beluhov, Nikolai
Published: (2025)

Strong coalitions in graphs
by: Golmohammadi, Hamidreza, et al.
Published: (2024)

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

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

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

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

On identity Seidel switches
by: Gervacio, Severino V.
Published: (2026)

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

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

Packing subdivisions into regular graphs
by: Montgomery, Richard, et al.
Published: (2025)

Homomorphic Preimages of Geometric Cycles
by: Cockburn, Sally
Published: (2015)

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

Fair coalition in graphs
by: Alikhani, Saeid, et al.
Published: (2025)

On Oriented Colourings of Graphs on Surfaces
by: Clow, Alexander
Published: (2024)

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

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

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

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

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

Reconstruction of caterpillar tanglegrams
by: Clifton, Ann, et al.
Published: (2025)