Cover Image

Neighbour sum distinguishing edge-weightings with local constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dailly, Antoine, Sidorowicz, ElÅ1/4bieta
Format:	Preprint
Published:	2022
Subjects:	Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Vizing-like theorem for union vertex-distinguishing edge coloring
by: Bousquet, Nicolas, et al.
Published: (2016)

Algorithms and hardness for Metric Dimension on digraphs
by: Dailly, Antoine, et al.
Published: (2023)

Connected Subtraction Games on Subdivided Stars
by: Dailly, Antoine, et al.
Published: (2018)

A generalization of Arc-Kayles
by: Dailly, Antoine, et al.
Published: (2017)

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
by: Dailly, Antoine, et al.
Published: (2018)

On the balanceability of some graph classes
by: Dailly, Antoine, et al.
Published: (2020)

Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
by: Burke, Kyle, et al.
Published: (2024)

The Closed Geodetic Game: algorithms and strategies
by: Dailly, Antoine, et al.
Published: (2024)

Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)

Partition games
by: Dailly, Antoine, et al.
Published: (2018)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)

Octal Games on Graphs: The game 0.33 on subdivided stars and bistars
by: Beaudou, Laurent, et al.
Published: (2016)

A hierarchy of edge-weight symmetries in perfect matchings
by: Bérczi, Kristóf, et al.
Published: (2026)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
by: Chakraborty, Dibyayan, et al.
Published: (2024)

Multigraph edge-coloring with local list sizes
by: Dhawan, Abhishek
Published: (2023)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
by: Bastida, Sam, et al.
Published: (2026)

On the edge expansion of random polytopes
by: Ferber, Asaf, et al.
Published: (2025)

Dividing sums of cycles in the semiring of functional digraphs
by: Bridoux, Florian, et al.
Published: (2025)

Restricted subgraphs of edge-colored graphs and applications
by: Sudakov, Benny
Published: (2024)

Vertex-edge domination on subclasses of bipartite graphs
by: Pandey, Arti, et al.
Published: (2025)

On the expressive power of $2$-edge-colourings of graphs
by: Bok, Jan, et al.
Published: (2025)

Resolving Sets in Temporal Graphs
by: Bok, Jan, et al.
Published: (2024)

Separating the edges of a graph by cycles and by subdivisions of $K_4$
by: Botler, Fábio, et al.
Published: (2024)

Filling some gaps on the edge coloring problem of split graphs
by: Couto, Fernanda, et al.
Published: (2024)

A verified implementation of the Misra and Gries edge coloring algorithm
by: Bhoja, Arohee
Published: (2025)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)

Regular packing of rooted hyperforests with root constraints in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2023)

Note about the complexity of the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2025)

Some polynomial classes for the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2026)

Variants of Wythoff game with terminal positions or blocking maneuvers
by: Renard, Antoine, et al.
Published: (2025)

On weighted partial triangulations of convex polygons
by: Blanca, Antonio, et al.
Published: (2026)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
by: Baste, Julien, et al.
Published: (2025)

Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
by: Foucaud, Florent, et al.
Published: (2025)

Characterizing traces of processes defined by precedence and response constraints: an order theory approach
by: Dukes, Mark, et al.
Published: (2023)

On Iiro Honkala's contributions to identifying codes
by: Hudry, Olivier, et al.
Published: (2024)

The Non-Cancelling Intersections Conjecture
by: Amarilli, Antoine, et al.
Published: (2024)

Star colouring and locally constrained graph homomorphisms
by: Antony, Cyriac, et al.
Published: (2023)

Optimal local identifying and local locating-dominating codes
by: Herva, Pyry, et al.
Published: (2023)

First order distinguishability of sparse random graphs
by: Hershko, Tal, et al.
Published: (2024)

A concentration phenomenon for $h$-extra edge-connectivity reliability analysis of enhanced hypercubes $Q_{n,2}$ with exponentially many faulty links
by: Sun, Yali, et al.
Published: (2024)