-decompositions of -graphs when is an -graph with exactly 2 edges.
Sousa, Teresa (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Sousa, Teresa (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Anton Kotzig (1968)
Matematický časopis
Similarity:
Jaroslav Ivanco (2010)
Discussiones Mathematicae Graph Theory
Similarity:
Given a family ℱ of multigraphs without isolated vertices, a multigraph M is called ℱ-decomposable if M is an edge disjoint union of multigraphs each of which is isomorphic to a member of ℱ. We present necessary and sufficient conditions for existence of such decompositions if ℱ consists of all multigraphs of size q except for one. Namely, for a multigraph H of size q we find each multigraph M of size kq, such that every partition of the edge set of M into parts of cardinality q contains...
Jozef Fiamčík (1984)
Archivum Mathematicum
Similarity:
Bohdan Zelinka (1978)
Časopis pro pěstování matematiky
Similarity:
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: