Exact square coloring of certain classes of graphs: complexity and algorithms

DOI10.1016/j.tcs.2022.08.008OpenAlexW4292241198MaRDI QIDQ2172606

Priyamvada, B. S. Panda

Publication date: 16 September 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.08.008

zbMATH Keywords

chordal graphsNP-completeinjective coloringexact distance graphsexact square coloring

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Complexity and algorithms for injective edge coloring of graphs

Cites Work

• Sparsity. Graphs, structures, and algorithms
• A linear time recognition algorithm for proper interval graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• A recognition algorithm for the intersection graphs of paths in trees
• Chromatic numbers of exact distance graphs
• On the algorithmic aspects of strong subcoloring
• Threshold graphs and related topics
• Colouring exact distance graphs of chordal graphs
• Restrained domination in some subclasses of chordal graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Injective coloring of some subclasses of bipartite graphs and chordal graphs
• Exact square coloring of subcubic planar graphs
• A REVIEW OF TREE CONVEX SETS TEST
• Exact Distance Colouring in Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exact square coloring of certain classes of graphs: complexity and algorithms