deBruijn-like sequences and the irregular chromatic number of paths and cycles
From MaRDI portal
(Redirected from Publication:1045102)
DeBruijn-like sequences and the irregular chromatic number of paths and cycles
DeBruijn-like sequences and the irregular chromatic number of paths and cycles
Recommendations
Cites work
- A fast algorithm for the construction of universal footprinting templates in DNA
- Distinguishing Cartesian powers of graphs
- Distinguishing geometric graphs
- Every planar map is four colorable
- scientific article; zbMATH DE number 2131198 (Why is no real title available?)
- scientific article; zbMATH DE number 5128956 (Why is no real title available?)
- scientific article; zbMATH DE number 4097437 (Why is no real title available?)
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- scientific article; zbMATH DE number 1021588 (Why is no real title available?)
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- Irregular colorings of some graph classes
- On the irregular chromatic number of a graph
- Symmetry breaking in graphs
- The distinguishing chromatic number
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
- Vertex-distinguishing proper edge-colorings
This page was built for publication: deBruijn-like sequences and the irregular chromatic number of paths and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045102)