Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A new vertex distinguishing total coloring of trees

From MaRDI portal
Publication:2671015
Jump to:navigation, search

DOI10.3934/MATH.2021550OpenAlexW3175159370MaRDI QIDQ2671015FDOQ2671015


Authors: Chao Yang, Bing Yao, Zhixiang Yin Edit this on Wikidata


Publication date: 3 June 2022

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

Full work available at URL: https://doi.org/10.3934/math.2021550





zbMATH Keywords

treestotal coloringvertex distinguishing coloring


Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)


Cites Work

  • Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
  • Vertex-distinguishing proper edge-colorings
  • Some results on spanning trees
  • Balanced edge colorings.
  • Title not available (Why is that?)






This page was built for publication: A new vertex distinguishing total coloring of trees

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2671015&oldid=15501441"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 10:49. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki