Recognizable coloring of graphs
From MaRDI portal
Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cites work
- scientific article; zbMATH DE number 5128956 (Why is no real title available?)
- scientific article; zbMATH DE number 3895095 (Why is no real title available?)
- Dominated and dominator colorings over (edge) corona and hierarchical products
- Domination in Graphs: Core Concepts
- Recognizable colorings of cycles and trees
- Recognizable colorings of graphs
- The spectrum of the edge corona of two graphs
This page was built for publication: Recognizable coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892108)