Normalformen planarer Graphen. II

DOI10.1007/BF02242388MaRDI QIDQ2557705zbMATH OpenFDO

Authors Yanyan Li

Publication date 1972

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02242388

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Graph theory (05Cxx)

Cites work

• A structural characterization of planar combinatorial graphs
• An Efficient Algorithm for Graph Isomorphism
• Einbettung von Streckenkomplexen in die Ebene
• GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3220184 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• scientific article; zbMATH DE number 3262985 (Why is no real title available?)
• scientific article; zbMATH DE number 3270498 (Why is no real title available?)
• scientific article; zbMATH DE number 3024665 (Why is no real title available?)
• Locally Hamiltonian and planar graphs

Cited in

(1)

• Orthogonal drawings of graphs for the automation of VLSI circuit design

This page was built for publication: Normalformen planarer Graphen. II

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