The following pages link to Additive coloring of planar graphs (Q742621):
Displaying 18 items.
- A note on adjacent vertex distinguishing colorings of graphs (Q266908) (← links)
- A note on vertex colorings of plane graphs (Q472144) (← links)
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (Q511730) (← links)
- Graphs with multiplicative vertex-coloring 2-edge-weightings (Q512893) (← links)
- Colourings of graphs by labellings (Q1687834) (← links)
- Graph coloring and Graham's greatest common divisor problem (Q1690244) (← links)
- Upper bounds on inclusive distance vertex irregularity strength (Q2053732) (← links)
- A note on additive choice number of planar graphs (Q2172418) (← links)
- Additive list coloring of planar graphs with given girth (Q2175242) (← links)
- Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 (Q2219970) (← links)
- From the 1-2-3 conjecture to the Riemann hypothesis (Q2225418) (← links)
- Planar graphs with girth 20 are additively 3-choosable (Q2306581) (← links)
- On the additive chromatic number of several families of graphs (Q2308457) (← links)
- The \(k\)-strong induced arboricity of a graph (Q2408964) (← links)
- The inapproximability for the \((0,1)\)-additive number (Q2816507) (← links)
- Upper bounds on distance vertex irregularity strength of some families of graphs (Q5089899) (← links)
- Sum-distinguishing number of sparse hypergraphs (Q6171496) (← links)
- An Alon-Tarsi style theorem for additive colorings (Q6544521) (← links)
