Neighbor sum distinguishing total colorings of triangle free planar graphs
From MaRDI portal
Publication:2355461
Recommendations
- Neighbor sum distinguishing total colorings of planar graphs
- A note on the neighbor sum distinguishing total coloring of planar graphs
- On the neighbor sum distinguishing total coloring of planar graphs
- Neighbor sum distinguishing total coloring of triangle free IC-planar graphs
- Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
Cites work
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
- Antimagic labelling of vertex weighted graphs
- Bounding the monomial index and \((1,l)\)-weight choosability of a graph
- Combinatorial Nullstellensatz
- Edge weights and vertex colours
- Graph theory with applications
- Irregularity strength of regular graphs
- Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing total colorings of planar graphs
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
- On a \(1,2\) conjecture
- On adjacent-vertex-distinguishing total coloring of graphs
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- On the total-neighbor-distinguishing index by sums
- The adjacent vertex distinguishing total coloring of planar graphs
- Total weight choosability of graphs
- Total weight choosability of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Weighted-1-antimagic graphs of prime power order
Cited in
(22)- Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions
- scientific article; zbMATH DE number 7746013 (Why is no real title available?)
- Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
- Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles
- Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Neighbor sum distinguishing total coloring of triangle free IC-planar graphs
- Asymptotically optimal neighbor sum distinguishing total colorings of graphs
- Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
- Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
- A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
- On the neighbor sum distinguishing total coloring of planar graphs
- A note on the neighbor sum distinguishing total coloring of planar graphs
- Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
- Neighbor sum distinguishing total chromatic number of planar graphs
- Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
- Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers
- Neighbor sum distinguishing total coloring of sparse IC-planar graphs
- Neighbor sum distinguishing total colorings of planar graphs
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
This page was built for publication: Neighbor sum distinguishing total colorings of triangle free planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355461)
