scientific article; zbMATH DE number 3308991

zbMATH Open0194.25201MaRDI QIDQ5589872FDOQ5589872

Authors: Florica Kramer, Horst Kramer 

Publication date: 1969

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

zbMATH Keywords

topology

Cited In (20)

• The subchromatic number of a graph
• The \(k\)-distance chromatic number of trees and cycles
• Exact square coloring of certain classes of graphs: complexity and algorithms
• The distance coloring of graphs
• 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4
• 2-distance colorings of some direct products of paths and cycles
• 2-distance list \((\varDelta +3)\)-coloring of sparse graphs
• Further results on 2-distance coloring of graphs
• The square chromatic number of the torus
• 2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method
• On the strong chromatic index of cyclic multigraphs
• Colouring exact distance graphs of chordal graphs
• Exact square coloring of graphs resulting from some graph operations and products
• Exact square coloring of subcubic planar graphs
• Graph \(r\)-hued colorings -- a survey
• 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10
• A survey on the distance-colouring of graphs
• Chromatic numbers of exact distance graphs
• \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
• Injective coloring of graphs revisited

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 Q5589872)