Equitable total coloring of Fibonacci graphs
From MaRDI portal
Publication:6583579
Recommendations
- Some conclusions of equitable total coloring of graph
- An algorithmic approach to equitable total chromatic number of graphs
- scientific article; zbMATH DE number 7274154
- On the equitable total coloring of double graph of some graphs
- Equitable total chromatic number of infinite classes of complete tripartite non balanced graphs
Cites work
- scientific article; zbMATH DE number 4108788 (Why is no real title available?)
- scientific article; zbMATH DE number 840689 (Why is no real title available?)
- An algorithmic approach to equitable total chromatic number of graphs
- Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs
- Determining the total colouring number is NP-hard
- Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even
- Equitable total chromatic number of splitting graph
- Equitable total coloring of \(C_m\square C_n\)
- Equitable total coloring of F_n W_n
- Equitable total coloring of complete $r$-partite $p$-balanced graphs
- Equitable total coloring of corona of cubic graphs
- Equitable total coloring of generalized Petersen graphs \(P(n,k)\).
- Equitable total coloring of graphs with maximum degree 3
- Equitable total-coloring of subcubic graphs
- Gossiping in Minimal Time
- On equitable chromatic number of tadpole graph \(t_{m,n}\)
- Quick gossiping by telegraphs
- Recognizing Knödel graphs
- Total colouring regular bipartite graphs is NP-hard
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)
