On defected colourings of graphs
From MaRDI portal
Recommendations
Cites work
- Adjacent strong edge coloring of graphs
- Conditional colorings of graphs
- Edge-Coloring and f-Coloring for Various Classes of Graphs
- General neighbour-distinguishing index of a graph
- On the neighbour-distinguishing index of a graph
- Total colouring regular bipartite graphs is NP-hard
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
- Vertex-distinguishing proper edge-colorings
Cited in
(5)- Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs
- scientific article; zbMATH DE number 6509339 (Why is no real title available?)
- scientific article; zbMATH DE number 5360693 (Why is no real title available?)
- A note on defective colorings of graphs in surfaces
- Defective Coloring on Classes of Perfect Graphs
This page was built for publication: On defected colourings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2439252)