Vertex-distinguishing edge colorings of graphs
From MaRDI portal
Publication:4797923
DOI10.1002/jgt.10076zbMath1008.05067OpenAlexW4236777858MaRDI QIDQ4797923
Oliver Riordan, Richard H. Schelp, Paul N. Balister
Publication date: 10 March 2003
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10076
Related Items
Adjacent vertex distinguishing total coloring of graphs with maximum degree 4, Inapproximability of the lid-chromatic number, On the neighbour-distinguishing index of a graph, \(D(\beta)\)-vertex-distinguishing total coloring of graphs, Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\), Upper bounds on vertex distinguishing chromatic indices of some Halin graphs, Point-distinguishing chromatic index of the union of paths, Vertex-coloring 2-edge-weighting of graphs, Vertex-distinguishing edge colorings of graphs with degree sum conditions, Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound, On the adjacent vertex-distinguishing equitable edge coloring of graphs, Locally identifying coloring of graphs with few P4s, Locally identifying colourings for graphs with given maximum degree, Vertex-distinguishing E-total colorings of graphs, On the vertex-distinguishing proper edge coloring of composition of complete graph and star, Strongly set-colorable graphs, Locally identifying coloring in bounded expansion classes of graphs, AVDTC numbers of generalized Halin graphs with maximum degree at least 6, Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9, Edge-distinguishing index of a graph, On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\), Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph, On the adjacent vertex distinguishing edge colourings of graphs, Color-blind index in graphs of very low degree, Vertex colouring edge partitions, Unnamed Item, Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree, An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph, Set colorings of graphs, Edge weights and vertex colours, \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
Cites Work
