Pages that link to "Item:Q1305536"
From MaRDI portal
The following pages link to On the vertex-distinguishing proper edge-colorings of graphs (Q1305536):
Displaying 50 items.
- 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)
- 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)
- How to personalize the vertices of a graph? (Q402468) (← 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)
- Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) (Q477654) (← 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)
- Properly edge-coloured subgraphs in colourings of bounded degree (Q659683) (← 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)
- \(r\)-strong edge colorings of graphs (Q856841) (← 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 distinguishing total coloring numbers of graphs with \(\varDelta =3\) (Q932658) (← 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)
- Balanced edge colorings. (Q1425105) (← links)
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\) (Q1613483) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← links)
- On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs (Q2132331) (← links)
- AVD-total-colouring of complete equipartite graphs (Q2341767) (← links)
- Edge colorings of the direct product of two graphs (Q2354610) (← links)
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 (Q2374166) (← links)
- A Vizing-like theorem for union vertex-distinguishing edge coloring (Q2410224) (← links)
- A note on adjacent strong edge coloring of \(K(n,m)\) (Q2431949) (← links)
- \(d\)-strong edge colorings of graphs (Q2441359) (← links)
- On the vertex-distinguishing proper edge coloring of composition of complete graph and star (Q2445910) (← links)
- Vertex distinguishing equitable total chromatic number of join graphs (Q2468789) (← links)
- Vertex-distinguishing proper edge colourings of some regular graphs (Q2470446) (← links)
- The algorithm for adjacent vertex distinguishing proper edge coloring of graphs (Q2788720) (← links)
- On vertex-distinguishing edge colorings of graphs (Q2799880) (← links)
- A conjecture of a vertex-distinguishing edge coloring of graphs (Q2924252) (← links)
- Point-distinguishing chromatic index of the union of paths (Q2940667) (← links)
- Vertex-distinguishing edge-colorings of linear forests (Q3059082) (← links)
- (Q3118113) (← links)
- (Q3300194) (← links)
- (Q3384719) (← links)
- Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time (Q3467875) (← links)
- (Q4504893) (← links)
- Decomposition of Complete Bipartite Even Graphs into Closed Trails (Q4802830) (← links)
- The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs (Q5054038) (← links)
