Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Graphs that are randomly packable by some common disconnected graphs

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

zbMath0918.05081MaRDI QIDQ1286572

K. Appert

Publication date: 3 May 1999

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)


zbMATH Keywords

randomly \(F\)-packable


Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)


Related Items (1)

Randomly \(P_k\)-decomposable graphs




This page was built for publication: Graphs that are randomly packable by some common disconnected graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1286572&oldid=13392043"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 11:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki