Cover Image

On fixing and distinguishing numbers of trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Buchanan, Calum, Dankelmann, Peter, Harris, Isabel, Horn, Paul, Perry, K. E., Rivett-Carnac, Emily
Format:	Preprint
Published:	2026
Subjects:	Combinatorics 05C15, 05C25, 05C05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Upper bounds for the list-distinguishing chromatic number
by: Banerjee, Amitayu, et al.
Published: (2024)

Arc-distinguishing of orientations of graphs
by: Gorzkowska, Aleksandra, et al.
Published: (2024)

The List-distinguishing chromatic number of graphs containing only small complete bigraphs
by: Banerjee, Amitayu
Published: (2025)

Irreducible distinguishing colourings and the Axiom of Choice
by: Stawiski, Marcin
Published: (2026)

Distinguishing chromatic number of middle and subdivision graphs
by: Banerjee, Amitayu, et al.
Published: (2024)

On the harmonious chromatic number of graphs
by: Araujo-Pardo, Gabriela, et al.
Published: (2022)

The number of distinguishing colorings of a Cartesian product graph
by: Alikhani, Saeid, et al.
Published: (2021)

The wild number of an edge-colored graph
by: Anders, Katie, et al.
Published: (2025)

Expanding the unicellular LLT polynomials of two-headed melting lollipops into ribbon Schurs
by: Wang, Victor
Published: (2025)

Distinguishing symmetric digraphs by proper arc-colourings of type I
by: Kalinowski, Rafał, et al.
Published: (2025)

Distinguishing regular graphs from lists
by: Kwaśny, Jakub, et al.
Published: (2022)

Long paths need not minimize $H$-colorings among trees
by: Galvin, David, et al.
Published: (2025)

Colour-permuting automorphisms of complete Cayley graphs
by: Alimirzaei, Shirin, et al.
Published: (2024)

On the Idempotent Graph of Matrix Ring
by: Patil, Avinash, et al.
Published: (2024)

Flip colouring of graphs II
by: Mifsud, Xandru
Published: (2024)

Hoffman-London graphs: When paths minimize $H$-colorings among trees
by: Galvin, David, et al.
Published: (2025)

On distinguishing digraphs by its quasisymmetric B-polynomial
by: Narayanan, N., et al.
Published: (2022)

On the minimal forts of trees
by: Cameron, Thomas R., et al.
Published: (2025)

Optimal bounds for zero-sum cycles. I. Odd order
by: Campbell, Rutger, et al.
Published: (2024)

A quantitative way to e-positivity of trees
by: Li, Ethan Y. H.
Published: (2025)

Brooks' type theorems for coloring parameters of locally finite graphs and Konig's Lemma
by: Banerjee, Amitayu, et al.
Published: (2024)

Distance Sequences to bound the Harary Index and other Wiener-type Indices of a Graph
by: Dankelmann, Peter
Published: (2024)

Fundamental Groups of Hamming Graphs
by: Behal, Keira, et al.
Published: (2023)

The distribution of the maximum protection number in simply generated trees
by: Heuberger, Clemens, et al.
Published: (2023)

Hat guessing number and guaranteed subgraphs
by: Bradshaw, Peter
Published: (2021)

Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
by: Xu, Shaohan, et al.
Published: (2025)

Throttling for standard zero forcing on directed graphs
by: Cairncross, Emily, et al.
Published: (2020)

Paint cost spectrum of perfect $k$-ary trees
by: Mafunda, Sonwabile, et al.
Published: (2024)

Full classification of anti-van der Waerden numbers of graph products of forests
by: Berikkyzy, Zhanar, et al.
Published: (2025)

Total coloring and efficient domination applications to non-Cayley non-Schreier vertex-transitive graphs
by: Dejter, Italo J.
Published: (2020)

A lower bound on the number of edges in DP-critical graphs. II. Four colors
by: Bradshaw, Peter, et al.
Published: (2024)

On the hat guessing number of a planar graph class
by: Bradshaw, Peter
Published: (2021)

Zykov sums of digraphs with diachromatic number equal to their harmonious number
by: Olsen, Mika, et al.
Published: (2022)

Efficient total colorings of cubic maps of girth 4 and related topics
by: Dejter, Italo J
Published: (2026)

Total coloring of regular graphs of girth = degree + 1
by: Dejter, Italo J.
Published: (2024)

From semi-total to equitable total colorings
by: Dejter, I. J.
Published: (2025)

On Distinguishing Graphs and Cost Number using Automorphism Representations
by: Gopaulsingh, Alexa, et al.
Published: (2025)

A census of face-transitive surfaces
by: Akpanya, Reymond, et al.
Published: (2025)

Sandpile groups for cones over trees
by: Reiner, Victor, et al.
Published: (2024)

Chromatic number and regular subgraphs
by: Janzer, Barnabás, et al.
Published: (2024)