Cover Image

Identifying open codes in trees and 4-cycle-free graphs of given maximum degree

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chakraborty, Dipayan, Foucaud, Florent, Henning, Michael A.
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Identifying codes in triangle-free graphs of bounded maximum degree
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 three domination-based identification problems in block graphs
by: Chakraborty, Dipayan, et al.
Published: (2018)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
by: Chakraborty, Dibyayan, et al.
Published: (2025)

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

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

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

Extremal digraphs for open neighbourhood location-domination and identifying codes
by: Foucaud, Florent, et al.
Published: (2023)

On the maximum $σ$-irregularity of trees with given order and maximum degree
by: Bašić, Milan
Published: (2026)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)

Nonregular graphs with a given maximum degree attaining maximum spectral radius
by: Huang, Zejun, et al.
Published: (2024)

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

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

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

The maximum number of cliques in graphs with given fractional matching number and minimum degree
by: Li, Chengli, et al.
Published: (2024)

The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
by: Zhang, Leilei
Published: (2024)

Isometric path complexity of graphs
by: Chakraborty, Dibyayan, et al.
Published: (2022)

A strengthening on consecutive odd cycles in graphs of given minimum degree
by: Lin, Hao, et al.
Published: (2024)

Injective edge-coloring of claw-free graphs with maximum degree 4
by: Huang, Danjun, et al.
Published: (2025)

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

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

A closure result on spanning $k$-trees of graphs with given minimum degree
by: Zhang, Wenqian
Published: (2026)

Cycle lengths in graphs of given minimum degree
by: Bai, Yandong, et al.
Published: (2025)

A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree
by: Wang, Yichen, et al.
Published: (2024)

The $n/2$-bound for locating-dominating sets in subcubic graphs
by: Chakraborty, Dipayan, et al.
Published: (2024)

Large fringe trees for random trees with given vertex degrees
by: Ojeda, Gabriel Berzunza, et al.
Published: (2026)

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

Planar graphs with the maximum number of induced 6-cycles
by: Savery, Michael
Published: (2021)

Monitoring edge-geodetic sets in graphs
by: Dev, Subhadeep R., et al.
Published: (2022)

Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
by: Das, Sandip, et al.
Published: (2023)

The distance spectral radius of $k$-uniform hypertrees with given number of vertices of maximum degree
by: Liu, Xiaoqi, et al.
Published: (2024)

The circumference of a graph with given minimum degree and clique number
by: Chen, Na, et al.
Published: (2025)

Maximum packings in graphs forbidding given rainbow cycles
by: Li, Ping, et al.
Published: (2026)

On graphs coverable by k shortest paths
by: Dumas, Maël, et al.
Published: (2022)

Antimagic labelling of graphs with maximum degree $Δ(G) = n - 4$
by: Beaudoire, Grégoire, et al.
Published: (2026)

Paired domination in graphs with minimum degree four
by: Bujtás, Csilla, et al.
Published: (2025)

On the isolation number of graphs with minimum degree four
by: Goddard, Wayne, et al.
Published: (2025)

Locating-dominating partitions for some classes of graphs
by: Foucaud, Florent, et al.
Published: (2025)

The minimum size of a chordal graph with given order and minimum degree
by: Zhan, Xingzhi, et al.
Published: (2024)