Pages that link to "Item:Q4362092"
From MaRDI portal
The following pages link to Vertex-distinguishing proper edge-colorings (Q4362092):
Displaying 50 items.
- A note on graph proper total colorings with many distinguishing constraints (Q264189) (← links)
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235) (← links)
- Adjacent vertex distinguishing total colorings of 2-degenerate graphs (Q294532) (← links)
- Vertex-distinguishing proper arc colorings of digraphs (Q298989) (← links)
- 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)
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- How to personalize the vertices of a graph? (Q402468) (← links)
- The strong chromatic index of Halin graphs (Q411659) (← links)
- Locally identifying colourings for graphs with given maximum degree (Q418899) (← links)
- The adjacent vertex distinguishing total chromatic number (Q442409) (← links)
- On the adjacent vertex-distinguishing acyclic edge coloring of some graphs (Q453364) (← links)
- Gap vertex-distinguishing edge colorings of graphs (Q456892) (← 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)
- Some results on spanning trees (Q601948) (← links)
- Vertex-coloring 2-edge-weighting of graphs (Q607360) (← links)
- Vertex-distinguishing edge colorings of graphs with degree sum conditions (Q607682) (← links)
- 2-distance vertex-distinguishing index of subcubic graphs (Q724740) (← 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)
- On the adjacent-vertex-strongly-distinguishing total coloring of graphs (Q931507) (← links)
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree (Q987498) (← links)
- Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes (Q987834) (← links)
- Concise proofs for adjacent vertex-distinguishing total colorings (Q1025519) (← links)
- An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph (Q1036905) (← links)
- Decompositions of pseudographs into closed trails of even sizes (Q1044920) (← links)
- deBruijn-like sequences and the irregular chromatic number of paths and cycles (Q1045102) (← links)
- Strong edge colorings of graphs (Q1126183) (← links)
- On the vertex-distinguishing proper edge-colorings of graphs (Q1305536) (← 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)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← links)
- On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs (Q1750669) (← links)
- Observability of the extended Fibonacci cubes (Q1810662) (← links)
- Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves (Q1876677) (← links)
- A smallest irregular oriented graph containing a given diregular one (Q1883255) (← links)
- Minimum number of palettes in edge colorings (Q2014713) (← links)
- On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs (Q2132331) (← links)
- On the total proper connection of graphs (Q2272614) (← links)
- General vertex-distinguishing total coloring of graphs (Q2336778) (← links)
- AVD-total-colouring of complete equipartite graphs (Q2341767) (← links)
