Decomposition of complete bipartite graphs into generalized prisms

DSpace/Manakin Repository

aaK citaci nebo jako odkaz na tento záznam použijte identifikátor:

Show simple item record Cichacz, Sylwia Fronček, Dalibor Kovář, Petr 2012-12-03T11:44:20Z 2012-12-03T11:44:20Z 2013
dc.identifier.citation European journal of combinatorics. 2013, vol. 34, issue 1, p. 104-110. cs
dc.identifier.issn 0195-6698
dc.description.abstract R. Häggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In (Cichacz and Fronček, 2009) [2] the first two authors established a necessary and sufficient condition for the existence of a factorization of the complete bipartite graph Kn,n into certain families of 3-regular graphs of order 2n. In this paper we tackle the problem of decompositions of Kn,n into certain 3-regular graphs called generalized prisms. We will show that certain families of 3-regular graphs of order 2n decompose the complete bipartite graph View the MathML source. cs
dc.format.extent 498332 bytes cs
dc.format.mimetype application/pdf cs
dc.language.iso en cs
dc.publisher Elsevier cs
dc.relation.ispartofseries European journal of combinatorics cs
dc.relation.uri cs
dc.title Decomposition of complete bipartite graphs into generalized prisms cs
dc.type article cs
dc.identifier.location Není ve fondu ÚK cs
dc.identifier.doi 10.1016/j.ejc.2012.07.018
dc.rights.access openAccess
dc.type.version submittedVersion
dc.type.status Peer-reviewed cs
dc.description.source Web of Science cs
dc.description.volume 34 cs
dc.description.issue 1 cs
dc.description.lastpage 110 cs
dc.description.firstpage 104 cs
dc.identifier.wos 000310110100010

Files in this item

Files Size Format View Description
european-journa ... cs-2013-34-1-104-kovar.pdf 486.6Kb PDF View/Open submittedVersion

This item appears in the following Collection(s)

Show simple item record

Search DSpace

Advanced Search



My Account