The Efficient Recognition on Net-extensibility of Graphs

Keywords: graph,net-embedding,transportation problem,perfect matching,forbidden configuration

Full-Text   Cite this paper   Add to My Lib

Abstract:

Full-Text