Vertex-distinguishing proper edge-colorings
From MaRDI portal
Publication:4362092
Recommendations
- A note on the vertex-distinguishing proper edge coloring of graphs.
- Vertex-distinguishing edge colorings of graphs with degree sum conditions
- A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
- On the vertex-distinguishing proper edge-coloring of \(K_{3,3}\vee K_t\)
- On vertex-distinguishing proper edge colorings of graphs satisfying the Ore condition.
Cited in
(97)- Vertex-distinguishing colorings of graphs a survey of recent developments
- Vertex colouring edge partitions
- Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
- Legally \((\varDelta +2)\)-coloring bipartite outerplanar graphs in cubic time
- An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
- The irregular coloring number of a tree
- Decompositions of pseudographs into closed trails of even sizes
- deBruijn-like sequences and the irregular chromatic number of paths and cycles
- On the vertex-distinguishing proper edge-colorings of graphs
- Observability of the extended Fibonacci cubes
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
- Strong edge colorings of graphs
- Harmonious and achromatic colorings of fragmentable hypergraphs
- On equitable vertex distinguishing edge colorings of trees
- Algorithmic complexity of proper labeling problems
- Concise proofs for adjacent vertex-distinguishing total colorings
- On the adjacent vertex-distinguishing acyclic edge coloring of some graphs
- Some results on spanning trees
- 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
- A conjecture of a vertex-distinguishing edge coloring of graphs
- Vertex-distinguishing proper edge colourings of some regular graphs
- The strong chromatic index of Halin graphs
- How to personalize the vertices of a graph?
- Vertex‐distinguishing edge colorings of random graphs
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- Vertex distinguishing equitable total chromatic number of join graphs
- Upper bounds on vertex distinguishing chromatic indices of some Halin graphs
- Locally identifying colourings for graphs with given maximum degree
- AVD-total-colouring of complete equipartite graphs
- Edge-distinguishing index of a graph
- Balanced edge colorings.
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Vertex-distinguishing edge colorings of graphs with degree sum conditions
- scientific article; zbMATH DE number 5174935 (Why is no real title available?)
- A smallest irregular oriented graph containing a given diregular one
- A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
- On the adjacent vertex-distinguishing equitable edge coloring of graphs
- \(D(\beta)\)-vertex-distinguishing total coloring of graphs
- \(d\)-strong edge colorings of graphs
- Vertex-distinguishing edge colorings of graphs
- 2-distance vertex-distinguishing index of subcubic graphs
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
- The adjacent vertex distinguishing total chromatic number
- Degree constrained subgraphs
- On the adjacent-vertex-strongly-distinguishing total coloring of graphs
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- Inapproximability of the lid-chromatic number
- Gap vertex-distinguishing edge colorings of graphs
- A note on adjacent strong edge coloring of \(K(n,m)\)
- Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph
- A note on graph proper total colorings with many distinguishing constraints
- Locally identifying coloring in bounded expansion classes of graphs
- Adjacent vertex distinguishing total colorings of 2-degenerate graphs
- On the neighbour-distinguishing index of a graph
- Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- Vertex-distinguishing proper arc colorings of digraphs
- 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
- A new vertex distinguishing total coloring of trees
- A note on the neighbour-distinguishing index of digraphs
- On the AVDTC of Sierpiński-type graphs
- The algorithm for adjacent vertex distinguishing proper edge coloring of graphs
- scientific article; zbMATH DE number 7447359 (Why is no real title available?)
- On the total proper connection of graphs
- On generalisations of the AVD conjecture to digraphs
- Kaleidoscopic colorings of graphs
- Some results on \((p, g,\sum)\)-valuation of graphs
- Locally identifying coloring of graphs with few P4s
- Union vertex-distinguishing edge colorings
- List-distinguishing Cartesian products of cliques
- scientific article; zbMATH DE number 7225175 (Why is no real title available?)
- On harmonious coloring of hypergraphs
- Some conclusions of vertex-distinguishing edge coloring of product graphs
- On the vertex-distinguishing proper edge coloring of composition of complete graph and star
- New estimates for the gap chromatic number
- A note on the vertex-distinguishing proper edge coloring of graphs.
- General vertex-distinguishing total coloring of graphs
- On vertex-distinguishing proper edge colorings of graphs satisfying the Ore condition.
- Distant total sum distinguishing index of graphs
- Harmonious and achromatic colorings of fragmentable hypergraphs
- On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs
- On vertex-distinguishing edge colorings of graphs
- Edge-colorings of 4-regular graphs with the minimum number of palettes
- On upper bound of vertex distinguishing word length on vertex labeled graph
- On defected colourings of graphs
- On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs
- scientific article; zbMATH DE number 5879543 (Why is no real title available?)
- \(D(r)\)-vertex distinguishing edge coloring of trees
- Upper bounds for adjacent vertex-distinguishing edge coloring
- A Vizing-like theorem for union vertex-distinguishing edge coloring
- Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves
- Minimum number of palettes in edge colorings
This page was built for publication: Vertex-distinguishing proper edge-colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4362092)
