scientific article; zbMATH DE number 7594599

MaRDI QIDQ5037994zbMATH OpenFDO

Authors Xiaoxiu Zhang, Danjun Huang

Publication date 29 September 2022

Full work available at URL https://www.actamath.com/Jwk_sxxb_cn/EN/Y2022/V65/I2/325

zbMATH Keywords

adjacent vertex distinguishing edge-coloringgirthmaximum degreeplanar graph

Mathematics Subject Classification ID

Vertex degrees (05C07) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
• Adjacent vertex distinguishing edge-coloring of planar graphs with girth at least five.
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
• The adjacent vertex distinguishing total coloring of planar graphs
• Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
• Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
• Adjacent vertex-distinguishing edge coloring of graphs
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree

Cites work

• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
• Adjacent strong edge coloring of graphs
• Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• Adjacent Vertex Distinguishing Edge‐Colorings
• Adjacent vertex distinguishing indices of planar graphs without 3-cycles
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs

Cited in

(8)

• Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four
• Adjacent vertex distinguishing edge-coloring of planar graphs with girth at least five.
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
• Adjacent vertex distinguishing edge coloring of planar graphs without intersecting triangles
• Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
• Adjacent vertex distinguishing edge coloring of planar graphs with girth at least 6

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5037994)