Injective coloring of graphs revisited
From MaRDI portal
Publication:2689514
DOI10.1016/j.disc.2023.113348OpenAlexW4320169620WikidataQ123010142 ScholiaQ123010142MaRDI QIDQ2689514
Boštjan Brešar, Ismael González Yero, Babak Samadi
Publication date: 10 March 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.09823
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of injective colorings and its generalizations
- On perfect codes in Cartesian products of graphs
- On idomatic partitions of direct products of complete graphs
- Two-step graphs of trees
- Injective colorings of sparse graphs
- Coloring problems on bipartite graphs of small diameter
- On low tree-depth decompositions
- Idomatic partitions of direct products of complete graphs
- Injective colorings of planar graphs with few colors
- On the chromatic number of cube-like graphs
- Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
- Chromatic numbers of exact distance graphs
- Injective coloring of some graph operations
- On the injective chromatic number of graphs
- Packing parameters in graphs
- Exact distance graphs of product graphs
- Perfect codes in graphs
- Injective coloring of some subclasses of bipartite graphs and chordal graphs
- Exact square coloring of subcubic planar graphs
- Independent perfect domination sets in Cayley graphs
- A Combinatorial Construction of Perfect Codes
- Towards a theory of domination in graphs
- NP completeness of finding the chromatic index of regular graphs
- Exact Distance Colouring in Trees
- Total Domination in Categorical Products of Graphs
- Injective coloring of planar graphs
- Complexity of fall coloring for restricted graph classes
- Domination in digraphs and their direct and Cartesian products
This page was built for publication: Injective coloring of graphs revisited
