Pages that link to "Item:Q4797923"
From MaRDI portal
The following pages link to Vertex-distinguishing edge colorings of graphs (Q4797923):
Displaying 31 items.
- Inapproximability of the lid-chromatic number (Q324747) (← links)
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) (Q358639) (← links)
- Upper bounds on vertex distinguishing chromatic indices of some Halin graphs (Q377916) (← links)
- Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound (Q383771) (← links)
- On the adjacent vertex-distinguishing equitable edge coloring of graphs (Q385210) (← links)
- Locally identifying colourings for graphs with given maximum degree (Q418899) (← links)
- Vertex-distinguishing E-total colorings of graphs (Q458138) (← links)
- Edge-distinguishing index of a graph (Q489314) (← links)
- Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph (Q508738) (← links)
- Color-blind index in graphs of very low degree (Q528569) (← links)
- Vertex-coloring 2-edge-weighting of graphs (Q607360) (← links)
- Vertex-distinguishing edge colorings of graphs with degree sum conditions (Q607682) (← links)
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph (Q741759) (← links)
- On the neighbour-distinguishing index of a graph (Q855303) (← links)
- \(D(\beta)\)-vertex-distinguishing total coloring of graphs (Q867795) (← links)
- AVDTC numbers of generalized Halin graphs with maximum degree at least 6 (Q925977) (← links)
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree (Q987498) (← links)
- Set colorings of graphs (Q1024295) (← links)
- Locally identifying coloring of graphs with few P4s (Q1685965) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← links)
- Edge weights and vertex colours (Q1826962) (← links)
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 (Q2374166) (← links)
- On the vertex-distinguishing proper edge coloring of composition of complete graph and star (Q2445910) (← links)
- Locally identifying coloring in bounded expansion classes of graphs (Q2446886) (← links)
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) (Q2460105) (← links)
- Vertex colouring edge partitions (Q2485946) (← links)
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number (Q2573644) (← links)
- (Q2857387) (← links)
- Point-distinguishing chromatic index of the union of paths (Q2940667) (← links)
- On the adjacent vertex distinguishing edge colourings of graphs (Q3568414) (← links)
- Strongly set-colorable graphs (Q4621304) (← links)
