Edge colorings of the direct product of two graphs
From MaRDI portal
Publication:2354610
DOI10.1007/s00373-014-1413-5zbMath1317.05057OpenAlexW2055038403MaRDI QIDQ2354610
Publication date: 20 July 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1413-5
edge coloringchromatic indexdirect product of graphsadjacent vertex distinguishing chromatic indexcolor set
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the neighbour-distinguishing index of a graph
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- Adjacent strong edge coloring of graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Adjacent vertex distinquishing edge colorings of the direct product of a regular graph by a path or cycle
- The NP-Completeness of Edge-Coloring
- Adjacent Vertex Distinguishing Edge‐Colorings
- On Neighbor-Distinguishing Index of Planar Graphs
This page was built for publication: Edge colorings of the direct product of two graphs