scientific article; zbMATH DE number 6470692

zbMATH Open1325.05085MaRDI QIDQ5500114FDOQ5500114

V. Yegnanarayanan

Publication date: 5 August 2015

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

zbMATH Keywords

polynomial time algorithmpartial pseudocomplete coloringpseudocoloring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Cited In (6)

• Title not available (Why is that?)
• Some colouring problems for Paley graphs
• Finding Pseudorandom Colorings of Pseudorandom Graphs
• The pseudoachromatic number of a graph
• On a class of completable partial edge-colourings
• On pseudoachromatic number of graphs

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