:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chakraborty, Dipayan, Nandi, Soumen, Sen, Sagnik, Supraja, D K
Format:	Preprint
Published:	2021
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2106.07424
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
by: Das, Sandip, et al.
Published: (2023)

Counting the minimum number of arcs in an oriented graph having weak diameter 2
by: Das, Sandip, et al.
Published: (2023)

Isometric path partition: a new upper bound and a characterization of some extremal graphs
by: Penev, Irena, et al.
Published: (2025)

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

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

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

The Interplay Between Domination and Separation in Graphs
by: Chakraborty, Dipayan, et al.
Published: (2026)

$C_{2k+1}$-coloring of bounded-diameter graphs
by: Piecyk, Marta
Published: (2024)

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

Parameterized complexity of isometric path partition: treewidth and diameter
by: Chakraborty, Dibyayan, et al.
Published: (2025)

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

Enumerating several statistics of r-Colored Dyck paths with no dd-steps having the same colors
by: Sun, Yidong, et al.
Published: (2025)

Finite k-Transversals of Infinite Families of Fat Convex Sets
by: Chakraborty, Sutanoya, et al.
Published: (2022)

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

On the Steiner $k$-diameter and Steiner ($k,k^{\prime}$)-radius of trees
by: Zhang, Qingnan, et al.
Published: (2025)

On fundamental results for pushable homomorphisms of oriented graphs
by: Das, Tapas, et al.
Published: (2023)

Large planar $(n,m)$-cliques
by: Bandopadhyay, Susobhan, et al.
Published: (2024)

Homomorphisms of (n,m)-graphs with respect to generalised switch
by: Sen, Sagnik, et al.
Published: (2022)

A proposed crank for $(k+j)$-colored partitions, with $j$ colors having distinct parts
by: Wilson, Samuel
Published: (2024)

List colorings of $k$-partite $k$-graphs
by: Dhawan, Abhishek
Published: (2023)

Trees whose path ideals have linear quotients
by: Chau, Trung, et al.
Published: (2025)

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

Packing coloring of graphs with long paths
by: Furmańczyk, Hanna, et al.
Published: (2025)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
by: Bernshteyn, Anton, et al.
Published: (2024)

Improved bound on the number of edges of diameter-$k$-critical graphs
by: Wang, Xiaolin, et al.
Published: (2024)

On the combinatorial structure of graphs with a spectral idempotent of small dual diameter
by: van Dam, Edwin R., et al.
Published: (2026)

Faster 3-colouring algorithm for graphs of diameter 3
by: Groenland, Carla, et al.
Published: (2026)

Antidirected hamiltonian paths in $k$-hypertournaments
by: Yang, Hong, et al.
Published: (2024)

Cross-free families have linear size
by: Tomon, István
Published: (2026)

Remarks on pseudo-vertex-transitive graphs with small diameter
by: Koolen, Jack H., et al.
Published: (2021)

A geometric proof of the infinite $(p, q)$-theorem for hyperplane piercing
by: Chakraborty, Sutanoya, et al.
Published: (2024)

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

Ordered Ramsey numbers of powers of paths
by: Girão, António, et al.
Published: (2024)

Edge-coloring $K_{n, n}$ with no 2-colored $C_{2k}$
by: Bal, Deepak, et al.
Published: (2025)

On $k$-colorability of $(bull, H)$-free graphs
by: Hodur, Nadzieja, et al.
Published: (2025)

A stepping-up lemma for monotone paths with bounded color complexity
by: Choi, Jigang, et al.
Published: (2026)

Settling the no-$(k+1)$-in-line problem when $k$ is not small
by: Kovács, Benedek, et al.
Published: (2025)

Odd coloring of $k$-trees
by: Kashima, Masaki, et al.
Published: (2025)

Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
by: Kanté, Mamadou Mostapha, et al.
Published: (2021)