Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 224058

From MaRDI portal
Publication:5286479
Jump to:navigation, search

zbMATH Open0770.05042MaRDI QIDQ5286479FDOQ5286479


Authors: Pranava K. Jha, Giora Slutzki Edit this on Wikidata


Publication date: 29 June 1993



Title of this publication is not available (Why is that?)



Recommendations

  • Product of graphs with crossing number one
  • scientific article; zbMATH DE number 139915
  • The thickness of some Cartesian product graphs.
  • The thickness of the Kronecker product of graphs


zbMATH Keywords

Kronecker productminorCartesian productouterplanarityalmost bipartite graphs


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)



Cited In (9)

  • Title not available (Why is that?)
  • A note on graph minors and strong products
  • Some remarks on the Kronecker product of graphs
  • Title not available (Why is that?)
  • Non-1-planarity of lexicographic products of graphs
  • Classes of normally and nearly normally torsion-free monomial ideals
  • Long cycles and long paths in the Kronecker product of a cycle and a tree
  • Generation of 3-connected, planar line graphs
  • ON PLANARITY OF DIRECT PRODUCT OF MULTIPARTITE COMPLETE GRAPHS





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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5286479&oldid=19941829"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 21:13. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki