A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
DOI10.1007/S10878-015-9886-6zbMATH Open1343.05066OpenAlexW1969022519MaRDI QIDQ306111FDOQ306111
Authors: Xue Han, Xiuyun Wang, Jihui Wang, Qiaoling Ma 
Publication date: 31 August 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9886-6
Recommendations
- Total colorings of planar graphs without adjacent triangles
- The adjacent vertex distinguishing total coloring of planar graphs
- Adjacent vertex distinguishing edge coloring of planar graphs without intersecting triangles
- Neighbor sum distinguishing total colorings of triangle free planar graphs
- scientific article; zbMATH DE number 6843221
- On the neighbor sum distinguishing total coloring of planar graphs
- A proper total coloring distinguishing adjacent vertices by sums of some product graphs
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
- Adjacent vertex distinguishing total colorings of outerplanar graphs
- A note on the neighbor sum distinguishing total coloring of planar graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- On adjacent-vertex-distinguishing total coloring of graphs
- Graph theory with applications
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Irregularity strength of regular graphs
- On the total-neighbor-distinguishing index by sums
- Neighbor sum distinguishing total colorings of triangle free planar graphs
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
- The adjacent vertex distinguishing total coloring of planar graphs
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- Antimagic labelling of vertex weighted graphs
- Neighbor sum distinguishing index of planar graphs
- An improved upper bound for the neighbor sum distinguishing index of graphs
- Combinatorial Nullstellensatz
- Weighted-1-antimagic graphs of prime power order
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
- Neighbor sum distinguishing total colorings of planar graphs
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
- Total weight choosability of graphs
- Total weight choosability of graphs
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
Cited In (6)
- Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10
- Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
- Total colorings of planar graphs without adjacent triangles
- Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
- Neighbor sum distinguishing total coloring of planar graphs with restrained cycles
- Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
This page was built for publication: A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306111)
