A Property of N-Graphs

DOI10.1109/T-C.1971.223085MaRDI QIDQ5623700zbMATH OpenFDO

Authors Akihiro Hashimoto, Kohei Noshita

Publication date 1971

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/T-C.1971.223085

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 32146
• A property of graphs of convex polytopes
• On Some Properties of the Struction of a Graph
• scientific article; zbMATH DE number 62433
• Publication:3203053
• scientific article; zbMATH DE number 3104074
• scientific article; zbMATH DE number 3912417
• scientific article; zbMATH DE number 23201
• A characterization of \(n\)-component graphs
• PROPERTY A AND GRAPHS WITH LARGE GIRTH

Cited in

(5)

• Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
• PROPERTY A AND GRAPHS WITH LARGE GIRTH
• A property of most of the known non-reconstructible digraphs
• scientific article; zbMATH DE number 6256303 (Why is no real title available?)
• Graph properties of graph associahedra

This page was built for publication: A Property of N-Graphs

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