Vertex-distinguishing E-total colorings of graphs
From MaRDI portal
(Redirected from Publication:458138)
Recommendations
- Vertex-distinguishing E-total colorings of the graphs \(mC_3\) and \(mC_4\)
- Vertex-distinguishing E-total coloring of complete bipartite graph in which one part has 4 vertices.
- Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{3,n}\) with \(n\geq 18\)
- Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{7,n}\) when \(7 \leq n \leq 95\)
- scientific article; zbMATH DE number 6129492
Cites work
- scientific article; zbMATH DE number 5011016 (Why is no real title available?)
- scientific article; zbMATH DE number 4072994 (Why is no real title available?)
- scientific article; zbMATH DE number 844141 (Why is no real title available?)
- scientific article; zbMATH DE number 894710 (Why is no real title available?)
- scientific article; zbMATH DE number 3895095 (Why is no real title available?)
- scientific article; zbMATH DE number 4193700 (Why is no real title available?)
- Asymptotic behaviour of the observability of \(Q_ n\)
- Localization of jumps of the point-distinguishing chromatic index of K_{n,n}
- On the point-distinguishing chromatic index of complete bipartite graphs
- On the vertex-distinguishing proper edge-colorings of graphs
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
- Vertex-distinguishing edge colorings of graphs
- Vertex-distinguishing proper edge-colorings
- Vertex-distinguishing total coloring of graphs
Cited in
(4)
This page was built for publication: Vertex-distinguishing E-total colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458138)
