On pseudocomplete coloring of graphs

MaRDI QIDQ5500114zbMATH OpenFDO

Authors V. Yegnanarayanan

Publication date 5 August 2015

zbMATH Keywords

partial pseudocomplete coloringpolynomial time algorithmpseudocoloring

Mathematics Subject Classification ID

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

Recommendations

• A note on pseudocomplete coloring of graphs
• scientific article; zbMATH DE number 1874447
• Coloring of pseudocubic graphs in three colors
• Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
• Complete colorings of planar graphs

Cited in

(7)

• On a class of completable partial edge-colourings
• The pseudoachromatic number of a graph
• A note on pseudocomplete coloring of graphs
• scientific article; zbMATH DE number 750697 (Why is no real title available?)
• Finding Pseudorandom Colorings of Pseudorandom Graphs
• On pseudoachromatic number of graphs
• Some colouring problems for Paley graphs

This page was built for publication: On pseudocomplete coloring of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500114)