View in EDS PDF Full Text

Decomposition of complete graphs into disconnected unicyclic bipartite graphs with seven edges and more than eight vertices.

Saved in:
Bibliographic Details
Title: Decomposition of complete graphs into disconnected unicyclic bipartite graphs with seven edges and more than eight vertices.
Authors: Banegas, D.1 daniel.banegas@ndsu.edu, Carlson, A.1 carl6746@umn.edu, Froncek, D.1 dalibor@d.umn.edu
Source: Journal of Combinatorial Mathematics & Combinatorial Computing. Jun2026, Vol. 129, p79-94. 16p.
Database: Mathematics Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: msf
DbLabel: Mathematics Source
An: 191370723
AccessLevel: 2
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Decomposition of complete graphs into disconnected unicyclic bipartite graphs with seven edges and more than eight vertices.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Banegas%2C+D%2E%22">Banegas, D.</searchLink><relatesTo>1</relatesTo><i> daniel.banegas@ndsu.edu</i><br /><searchLink fieldCode="AR" term="%22Carlson%2C+A%2E%22">Carlson, A.</searchLink><relatesTo>1</relatesTo><i> carl6746@umn.edu</i><br /><searchLink fieldCode="AR" term="%22Froncek%2C+D%2E%22">Froncek, D.</searchLink><relatesTo>1</relatesTo><i> dalibor@d.umn.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Combinatorial+Mathematics+%26+Combinatorial+Computing%22">Journal of Combinatorial Mathematics & Combinatorial Computing</searchLink>. Jun2026, Vol. 129, p79-94. 16p.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=msf&AN=191370723
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.61091/jcmcc129-07
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 16
        StartPage: 79
    Titles:
      – TitleFull: Decomposition of complete graphs into disconnected unicyclic bipartite graphs with seven edges and more than eight vertices.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Banegas, D.
      – PersonEntity:
          Name:
            NameFull: Carlson, A.
      – PersonEntity:
          Name:
            NameFull: Froncek, D.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 06
              Text: Jun2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 08353026
          Numbering:
            – Type: volume
              Value: 129
          Titles:
            – TitleFull: Journal of Combinatorial Mathematics & Combinatorial Computing
              Type: main
ResultId 1