scientific article; zbMATH DE number 907924
From MaRDI portal
Publication:4886768
Recommendations
Cites work
- scientific article; zbMATH DE number 4114662 (Why is no real title available?)
- scientific article; zbMATH DE number 3795986 (Why is no real title available?)
- scientific article; zbMATH DE number 844141 (Why is no real title available?)
- scientific article; zbMATH DE number 3895095 (Why is no real title available?)
- scientific article; zbMATH DE number 3312524 (Why is no real title available?)
- Graph with given achromatic number
Cited in
(38)- Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
- Adjacent strong edge colorings and total colorings of regular graphs
- A new vertex distinguishing total coloring of trees
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
- A note on the neighbour-distinguishing index of digraphs
- On generalisations of the AVD conjecture to digraphs
- scientific article; zbMATH DE number 844141 (Why is no real title available?)
- The \(k\)-observer problem on \(d\)-regular graphs
- Decompositions of pseudographs into closed trails of even sizes
- Kaleidoscopic colorings of graphs
- On the vertex-distinguishing proper edge-colorings of graphs
- Observability of the extended Fibonacci cubes
- Locally identifying coloring of graphs with few P4s
- Asymptotic behaviour of the observability of \(Q_ n\)
- Vertex-distinguishing proper edge colourings of some regular graphs
- How to personalize the vertices of a graph?
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- Decomposition of Complete Bipartite Even Graphs into Closed Trails
- Observable graphs
- Locally identifying colourings for graphs with given maximum degree
- Edge-distinguishing index of a graph
- Balanced edge colorings.
- Vertex-distinguishing edge colorings of graphs with degree sum conditions
- A smallest irregular oriented graph containing a given diregular one
- \(d\)-strong edge colorings of graphs
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
- The adjacent vertex distinguishing total chromatic number
- Distant total sum distinguishing index of graphs
- Inapproximability of the lid-chromatic number
- Observability of lattice graphs
- Gap vertex-distinguishing edge colorings of graphs
- Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph
- Locally identifying coloring in bounded expansion classes of graphs
- On the neighbour-distinguishing index of a graph
- Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound
- Upper bounds for adjacent vertex-distinguishing edge coloring
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
- Minimum number of palettes in edge colorings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886768)
