Equitable total coloring of Fibonacci graphs

DOI10.3770/J.ISSN:2095-2651.2024.02.001MaRDI QIDQ6583579

Yong Li, Yanan Su, Chunling Tong, Senyuan Su

Publication date: 6 August 2024

Published in: Journal of Mathematical Research with Applications (Search for Journal in Brave)

zbMATH Keywords

equitable total chromatic numberequitable total coloringFibonacci graph

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Determining the total colouring number is NP-hard
• Equitable total coloring of \(C_m\square C_n\)
• Equitable total coloring of \(F_n \vee W_n\)
• Total colouring regular bipartite graphs is NP-hard
• Quick gossiping by telegraphs
• Recognizing Knödel graphs
• Equitable total coloring of graphs with maximum degree 3
• Equitable total coloring of corona of cubic graphs
• Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even
• Equitable total-coloring of subcubic graphs
• Equitable total coloring of complete $r$-partite $p$-balanced graphs
• Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs
• Gossiping in Minimal Time
• An Algorithmic Approach to Equitable Total Chromatic Number of Graphs
• On equitable chromatic number of Tadpole graph T_{m,n}
• Equitable total chromatic number of splitting graph

This page was built for publication: Equitable total coloring of Fibonacci graphs

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