Vertex-distinguishing E-total colorings of graphs
From MaRDI portal
Publication:458138
DOI10.1007/S13369-011-0099-8zbMATH Open1298.05110OpenAlexW2061316998MaRDI QIDQ458138FDOQ458138
Authors: Xiang'en Chen, Yue Zu, Bing Yao, Zhiwen Wang, Jin Xu 
Publication date: 7 October 2014
Published in: Arabian Journal for Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13369-011-0099-8
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
E-total coloringvertex-distinguishing E-total chromatic numbervertex-distinguishing E-total coloring
Cites Work
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
- Vertex-distinguishing proper edge-colorings
- On the vertex-distinguishing proper edge-colorings of graphs
- Title not available (Why is that?)
- Vertex-distinguishing edge colorings of graphs
- Asymptotic behaviour of the observability of \(Q_ n\)
- Vertex-distinguishing total coloring of graphs
- Title not available (Why is that?)
- On the point-distinguishing chromatic index of complete bipartite graphs
- Title not available (Why is that?)
- Localization of jumps of the point-distinguishing chromatic index of K_{n,n}
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
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)
