γ-Chromatic Partition in Planar Graph Characterization

DOI10.1007/978-3-030-01123-9_45zbMath1442.05071OpenAlexW2913486348MaRDI QIDQ3296827

A. Tamil Elakkiya, M. Yamuna

Publication date: 2 July 2020

Published in: Trends in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-01123-9_45

zbMATH Keywords

domination number\(\gamma\)-uniquely colorable graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• A graph and its complement with specified properties. I: Connectivity
• Every planar graph with nine points has a nonplanar complement
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: γ-Chromatic Partition in Planar Graph Characterization