:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chakraborty, Dipayan, Hakanen, Anni, Lehtilä, Tuomo
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2406.19278
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Progress towards the two-thirds conjecture on locating-total dominating sets
by: Chakraborty, Dipayan, et al.
Published: (2022)

Identifying codes in triangle-free graphs of bounded maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)

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

Identifying codes in graphs of given maximum degree: Characterizing trees
by: Chakraborty, Dipayan, et al.
Published: (2024)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)

On lower bounds for cardinalities of several separating-dominating codes in graphs
by: Chakraborty, Dipayan, et al.
Published: (2024)

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

On open-separating dominating codes in graphs
by: Chakraborty, Dipayan, et al.
Published: (2024)

On independent domination and packing numbers of subcubic graphs
by: Bai, Xuqing, et al.
Published: (2024)

The Generalized Double Pouring Problem: Analysis, Bounds and Algorithms
by: Jäger, Gerold, et al.
Published: (2025)

On locating and neighbor-locating colorings of sparse graphs
by: Chakraborty, Dipayan, et al.
Published: (2023)

Coalition graphs of connected domination partitions in subcubic graphs
by: Dobrynin, Andrey A., et al.
Published: (2025)

On full-separating sets and related codes in graphs
by: Chakraborty, Dipayan, et al.
Published: (2024)

Partition strategies for the Maker-Breaker domination game
by: Bagan, Guillaume, et al.
Published: (2024)

Partition subcubic planar graphs into independent sets
by: Liu, Xujun, et al.
Published: (2024)

On three domination-based identification problems in block graphs
by: Chakraborty, Dipayan, et al.
Published: (2018)

On the unicyclic graphs having vertices that belong to all their (strong) metric bases
by: Hakanen, Anni, et al.
Published: (2022)

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

Complexity and equivalency of multiset dimension and ID-colorings
by: Hakanen, Anni, et al.
Published: (2023)

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

Levenshtein's Sequence Reconstruction Problem and Results for Larger Alphabet Sizes
by: Junnila, Ville, et al.
Published: (2025)

On Vertices Contained in All or in No Metric Basis
by: Hakanen, Anni, et al.
Published: (2021)

On the Metric Dimensions for Sets of Vertices
by: Hakanen, Anni, et al.
Published: (2020)

New Optimal Results on Codes for Location in Graphs
by: Junnila, Ville, et al.
Published: (2023)

Frustration indices of signed subcubic graphs
by: Chen, Sirui, et al.
Published: (2025)

Identifying Codes in Triangle‐Free Graphs of Bounded Maximum Degree
by: Dipayan Chakraborty, et al.
Published: (2026)

Packing edge-colorings of subcubic outerplanar graphs
by: Li, Sijin, et al.
Published: (2024)

Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)

The DP-coloring of the square of subcubic graphs
by: Zhao, Ren
Published: (2024)

Median eigenvalues of subcubic graphs
by: Acharya, Hricha, et al.
Published: (2025)

On the independence number in subcubic graphs
by: Harant, Jochen, et al.
Published: (2025)

On the $(1^2,2^4)$-packing edge-coloring of subcubic graphs
by: Liu, Xujun, et al.
Published: (2024)

Fractional balanced chromatic number of signed subcubic graphs
by: Hu, Xiaolan, et al.
Published: (2025)

11/4-colorability of subcubic triangle-free graphs
by: Dvořák, Zdeněk, et al.
Published: (2022)

On $(1^2,2^2)$-packing edge-coloring of sparse subcubic graphs
by: Liu, Xujun, et al.
Published: (2026)

Every subcubic graph is packing $(1,1,2,2,3)$-colorable
by: Liu, Xujun, et al.
Published: (2024)

Strong list-chromatic index of subcubic graphs is at most 10
by: Tang, Yunfang, et al.
Published: (2025)

Every connected subcubic graph except the Petersen graph is packing $(1,1,2,2)$-colorable
by: Hou, Xinmin, et al.
Published: (2026)

A note on locating-dominating sets in twin-free graphs
by: Bousquet, Nicolas, et al.
Published: (2024)

Impact of local girth on the S-packing coloring of k-saturated subcubic graphs
by: Zein, Ayman El, et al.
Published: (2026)