Decomposition of complete graphs into disconnected bipartite graphs with seven edges and eight vertices.
Saved in:
| Title: | Decomposition of complete graphs into disconnected bipartite graphs with seven edges and eight vertices. |
|---|---|
| Authors: | Froncek, Dalibor1 dalibor@d.umn.edu, Kubesa, Michael2 michael.kubesa@vsb.cz |
| Source: | Communications in Combinatorics & Optimization. Jun2026, Vol. 12 Issue 2, p661-684. 24p. |
| Database: | Academic Search Ultimate |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: asn DbLabel: Academic Search Ultimate An: 190422187 AccessLevel: 2 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Decomposition of complete graphs into disconnected bipartite graphs with seven edges and eight vertices. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Froncek%2C+Dalibor%22">Froncek, Dalibor</searchLink><relatesTo>1</relatesTo><i> dalibor@d.umn.edu</i><br /><searchLink fieldCode="AR" term="%22Kubesa%2C+Michael%22">Kubesa, Michael</searchLink><relatesTo>2</relatesTo><i> michael.kubesa@vsb.cz</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Communications+in+Combinatorics+%26+Optimization%22">Communications in Combinatorics & Optimization</searchLink>. Jun2026, Vol. 12 Issue 2, p661-684. 24p. |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=asn&AN=190422187 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.22049/cco.2024.29264.1915 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 24 StartPage: 661 Titles: – TitleFull: Decomposition of complete graphs into disconnected bipartite graphs with seven edges and eight vertices. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Froncek, Dalibor – PersonEntity: Name: NameFull: Kubesa, Michael IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 06 Text: Jun2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 25382128 Numbering: – Type: volume Value: 12 – Type: issue Value: 2 Titles: – TitleFull: Communications in Combinatorics & Optimization Type: main |
| ResultId | 1 |