On locally identifying coloring of Cartesian product and tensor product of graphs

DOI10.1016/J.DAM.2024.07.046zbMATH Open1547.05084MaRDI QIDQ6611088

Swati Kumari, I. Vinod Reddy, Sriram Bhyravarapu

Publication date: 26 September 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

graph coloringCartesian producttensor productlocally identifying coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Locally identifying colourings for graphs with given maximum degree
• Locally identifying coloring of graphs
• On subinvariants i. e. semi-invariants to binary quantics of an unlimited order.
• Locally identifying coloring of graphs with few P4s
• The chromatic number and other functions of the lexicographic product
• Counterexamples to Hedetniemi's conjecture
• Locally identifying coloring in bounded expansion classes of graphs
• Graphs with Given Group and Given Graph-Theoretical Properties
• The Kronecker Product of Graphs
• On a new class of codes for identifying vertices in graphs
• Vertex-distinguishing edge colorings of graphs
• On locally identifying coloring of graphs

This page was built for publication: On locally identifying coloring of Cartesian product and tensor product of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611088)