Vertex-distinguishing edge colorings of graphs
From MaRDI portal
(Redirected from Publication:4797923)
Recommendations
Cited in
(52)- Vertex colouring edge partitions
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
- scientific article; zbMATH DE number 7511519 (Why is no real title available?)
- scientific article; zbMATH DE number 6729895 (Why is no real title available?)
- Strongly set-colorable graphs
- On locally identifying coloring of Cartesian product and tensor product of graphs
- scientific article; zbMATH DE number 140040 (Why is no real title available?)
- scientific article; zbMATH DE number 5942285 (Why is no real title available?)
- Edge weights and vertex colours
- scientific article; zbMATH DE number 4218322 (Why is no real title available?)
- Locally identifying coloring of graphs with few P4s
- Set colorings of graphs
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
- Point-distinguishing chromatic index of the union of paths.
- AVDTC numbers of generalized Halin graphs with maximum degree at least 6
- Vertex distinguishing edge coloring of a hexagonal system
- scientific article; zbMATH DE number 6403944 (Why is no real title available?)
- Vertex-distinguishing proper edge colourings of some regular graphs
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- Vertex-colored encompassing graphs
- On harmonious coloring of hypergraphs
- Upper bounds on vertex distinguishing chromatic indices of some Halin graphs
- Locally identifying colourings for graphs with given maximum degree
- Edge-distinguishing index of a graph
- scientific article; zbMATH DE number 6129492 (Why is no real title available?)
- scientific article; zbMATH DE number 6403946 (Why is no real title available?)
- Balanced edge colorings.
- On the vertex-distinguishing proper edge coloring of composition of complete graph and star
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Vertex-distinguishing edge-colorings of linear forests
- Vertex-distinguishing edge colorings of graphs with degree sum conditions
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
- On the adjacent vertex-distinguishing equitable edge coloring of graphs
- \(D(\beta)\)-vertex-distinguishing total coloring of graphs
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
- On vertex-distinguishing edge colorings of graphs
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- Inapproximability of the lid-chromatic number
- Color-blind index in graphs of very low degree
- New concepts on vertex and edge coloring of simple vague graphs
- Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph
- Distant set distinguishing edge colourings of graphs
- Locally identifying coloring in bounded expansion classes of graphs
- On the neighbour-distinguishing index of a graph
- Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound
- scientific article; zbMATH DE number 919277 (Why is no real title available?)
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- A Vizing-like theorem for union vertex-distinguishing edge coloring
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
- On the adjacent vertex distinguishing edge colourings of graphs
- Vertex-distinguishing E-total colorings of graphs
- Vertex coloring edge-weighted digraphs
This page was built for publication: Vertex-distinguishing edge colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4797923)
