Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
From MaRDI portal
(Redirected from Publication:277657)
Recommendations
- scientific article; zbMATH DE number 7478554
- Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
- Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
- Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
- On the neighbor sum distinguishing total coloring of planar graphs
Cites work
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
- Adjacent vertex distinguishing total colorings of outerplanar graphs
- Bounding the monomial index and \((1,l)\)-weight choosability of a graph
- Combinatorial Nullstellensatz
- Graph theory
- 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 triangle free planar graphs
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
- 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
Cited in
(23)- \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性
- Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions
- Neighbor sum distinguishing total choice number of planar graphs without 6-cycles
- Neighbor sum distinguishing total choosability of cubic graphs
- Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
- Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions
- Neighbor sum distinguishing total choosability of planar graphs
- Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers
- Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10
- scientific article; zbMATH DE number 7478554 (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 4-cycles
- Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
- Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13
- Neighbor sum distinguishing total coloring of planar graphs with restrained cycles
- Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
- A note on the neighbor sum distinguishing total coloring of planar graphs
- Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles
- Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
- Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
- The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
- Neighbor sum distinguishing total choosability of IC-planar graphs
- Neighbor sum distinguishing total chromatic number of planar graphs
This page was built for publication: Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q277657)
