Homogeneous colourings of graphs
From MaRDI portal
Publication:5878484
Recommendations
Cites work
- scientific article; zbMATH DE number 1953089 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- A survey on the distance-colouring of graphs
- Color-bounded hypergraphs. I: General results
- Describing short paths in plane graphs of girth at least 5
- Distance-two colourings of Barnette graphs
- From NMNR-coloring of hypergraphs to homogenous coloring of graphs
- How hard is it to determine if a graph has a 2-role assignment?
- Mixed hypergraphs and beyond
- No Graph is Perfect
- Role colouring a graph
- Wiener index of hexagonal systems
- Worm colorings
This page was built for publication: Homogeneous colourings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5878484)