scientific article; zbMATH DE number 7153948

zbMATH Open1428.05093MaRDI QIDQ5210481FDOQ5210481

Author name not available (Why is that?)

Publication date: 20 January 2020

Full work available at URL: http://www.pvamu.edu/aam/wp-content/uploads/sites/182/2019/12/36-R1287_AAM_Anan_SA_040919_Posted_121119.pdf

Title of this publication is not available (Why is that?)

zbMATH Keywords

edge-coloringstrong productadjacent vertex-distinguishing proper edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Adjacent strong edge coloring of graphs
• A note on adjacent vertex distinguishing colorings of graphs
• On the adjacent vertex-distinguishing acyclic edge coloring of some graphs
• A textbook of graph theory
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Adjacent Vertex Distinguishing Edge‐Colorings
• AVD-edge coloring on powers of paths

Cited In (3)

• Title not available (Why is that?)
• Exact vertex forwarding index of the strong product of complete graph and cycle
• Title not available (Why is that?)

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 Q5210481)