scientific article; zbMATH DE number 1953111

MaRDI QIDQ4414515zbMATH OpenFDO

Authors Narayan Vikas

Publication date 25 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2573/25730399.htm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• List homomorphisms to reflexive graphs
• Bi‐arc graphs and the complexity of list homomorphisms
• The complexity of the list homomorphism problem for graphs
• The complexity of the list homomorphism problem for graphs
• On list coloring and list homomorphism of permutation and interval graphs

Cited in

(6)

• List homomorphisms to reflexive graphs
• Algorithms for partition of some class of graphs under compaction and vertex-compaction
• scientific article; zbMATH DE number 2151253 (Why is no real title available?)
• Simple confluently persistent catenable lists
• Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon
• Computational complexity relationship between compaction, vertex-compaction, and retraction

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