The following pages link to (Q4886768):
Displayed 34 items.
- Inapproximability of the lid-chromatic number (Q324747) (← links)
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) (Q358639) (← links)
- Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound (Q383771) (← links)
- How to personalize the vertices of a graph? (Q402468) (← links)
- Locally identifying colourings for graphs with given maximum degree (Q418899) (← links)
- The adjacent vertex distinguishing total chromatic number (Q442409) (← links)
- Gap vertex-distinguishing edge colorings of graphs (Q456892) (← links)
- Edge-distinguishing index of a graph (Q489314) (← links)
- Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph (Q508738) (← 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)
- Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes (Q987834) (← links)
- Adjacent strong edge colorings and total colorings of regular graphs (Q1041555) (← links)
- Decompositions of pseudographs into closed trails of even sizes (Q1044920) (← links)
- On the vertex-distinguishing proper edge-colorings of graphs (Q1305536) (← links)
- Asymptotic behaviour of the observability of \(Q_ n\) (Q1377684) (← links)
- Balanced edge colorings. (Q1425105) (← links)
- Locally identifying coloring of graphs with few P4s (Q1685965) (← links)
- Upper bounds for adjacent vertex-distinguishing edge coloring (Q1702826) (← links)
- Distant total sum distinguishing index of graphs (Q1712511) (← links)
- Observability of the extended Fibonacci cubes (Q1810662) (← links)
- A smallest irregular oriented graph containing a given diregular one (Q1883255) (← links)
- Minimum number of palettes in edge colorings (Q2014713) (← links)
- Kaleidoscopic colorings of graphs (Q2364091) (← links)
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 (Q2374166) (← links)
- \(d\)-strong edge colorings of graphs (Q2441359) (← links)
- Locally identifying coloring in bounded expansion classes of graphs (Q2446886) (← links)
- Vertex-distinguishing proper edge colourings of some regular graphs (Q2470446) (← links)
- On generalisations of the AVD conjecture to digraphs (Q2657104) (← links)
- A new vertex distinguishing total coloring of trees (Q2671015) (← links)
- (Q2857387) (← links)
- Decomposition of Complete Bipartite Even Graphs into Closed Trails (Q4802830) (← links)
- A note on the neighbour-distinguishing index of digraphs (Q5056824) (← links)