Distinguishing infinite star-free graphs

Marcin Stawiski

Applied Mathematics and Computation, 2025, vol. 495, issue C

Abstract: Call a vertex or an edge colouring of a graph distinguishing, if is not preserved by any non-identity automorphism. For a graph H, we say that a graph G is H-free if there is no induced subgraph of G, which is isomorphic to H. Gorzkowska, Kargul, Musiał and Pal proved that for every natural number n greater than 2 each finite connected K1,n-free graph on at least six vertices has a distinguishing edge colouring using at most n−1 colours. We extend this result to all locally finite connected K1,n-free graphs on at least six vertices.

Keywords: Distinguishing colouring; Distinguishing index; Infinite graph; Star-free graph (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300325000372
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:495:y:2025:i:c:s0096300325000372

DOI: 10.1016/j.amc.2025.129310

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().