The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs

DOI10.5614/ejgta.2022.10.2.5zbMath1499.05210arXiv2102.07576OpenAlexW3132570651MaRDI QIDQ5054038

Grant Fickes, Wing Hong Tony Wong

Publication date: 29 November 2022

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.07576

zbMATH Keywords

vertex coloringgraph embeddingspiderschorded cyclescaterpillarspetal graphsEDCNedge-distinguishing

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On harmonious colouring of trees
• The distinguishing chromatic number
• The harmonious chromatic number of complete \(r\)-ary trees
• On the vertex-distinguishing proper edge-colorings of graphs
• Euler cycles in the complete graph \(K_{2m+1}\)
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• On the harmonious chromatic number of a graph
• Distinguishing numbers for graphs and groups
• Graphs which have \(n/2\)-minimal line-distinguishing colourings
• On the Harmonious Coloring of Graphs
• A note on the line‐distinguishing chromatic number and the chromatic index of a graph
• The growth rate of the harmonious chromatic number

This page was built for publication: The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs