scientific article; zbMATH DE number 907924

zbMATH Open0853.05040MaRDI QIDQ4886768FDOQ4886768

Authors: Ján Černý, Mirko Horňák, Roman Soták 

Publication date: 9 December 1996

Full work available at URL: https://eudml.org/doc/34424

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 844141
• Asymptotic behaviour of the observability of \(Q_ n\)
• Observable graphs
• scientific article; zbMATH DE number 994581

zbMATH Keywords

matchingpathsobservabilitycycleswheelscomplete graphschromatic indexcolour set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Graph with given achromatic number
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (38)

• Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
• How to personalize the vertices of a graph?
• Observability of the extended Fibonacci cubes
• The \(k\)-observer problem on \(d\)-regular graphs
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound
• Title not available (Why is that?)
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
• Kaleidoscopic colorings of graphs
• Vertex-distinguishing edge colorings of graphs with degree sum conditions
• On the vertex-distinguishing proper edge-colorings of graphs
• Inapproximability of the lid-chromatic number
• Observability of lattice graphs
• Locally identifying colourings for graphs with given maximum degree
• The adjacent vertex distinguishing total chromatic number
• Gap vertex-distinguishing edge colorings of graphs
• Observable graphs
• Balanced edge colorings.
• A new vertex distinguishing total coloring of trees
• Adjacent strong edge colorings and total colorings of regular graphs
• Decompositions of pseudographs into closed trails of even sizes
• Edge-distinguishing index of a graph
• Locally identifying coloring of graphs with few P4s
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
• \(d\)-strong edge colorings of graphs
• A note on the neighbour-distinguishing index of digraphs
• Vertex-distinguishing proper edge colourings of some regular graphs
• Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph
• Upper bounds for adjacent vertex-distinguishing edge coloring
• Decomposition of Complete Bipartite Even Graphs into Closed Trails
• A smallest irregular oriented graph containing a given diregular one
• On generalisations of the AVD conjecture to digraphs
• Distant total sum distinguishing index of graphs
• On the neighbour-distinguishing index of a graph
• An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
• Asymptotic behaviour of the observability of \(Q_ n\)
• Locally identifying coloring in bounded expansion classes of graphs
• 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)