View in EDS PDF Full Text

Strong k-transitive oriented graphs with large minimum degree.

Saved in:
Bibliographic Details
Title: Strong k-transitive oriented graphs with large minimum degree.
Authors: Daamouch, Moussa1 moussa.daamouch@ul.edu.lb
Source: Communications in Combinatorics & Optimization. Sep2025, Vol. 10 Issue 3, p681-693. 13p.
Database: Academic Search Ultimate
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: asn
DbLabel: Academic Search Ultimate
An: 182994824
AccessLevel: 2
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Strong k-transitive oriented graphs with large minimum degree.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Daamouch%2C+Moussa%22">Daamouch, Moussa</searchLink><relatesTo>1</relatesTo><i> moussa.daamouch@ul.edu.lb</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+in+Combinatorics+%26+Optimization%22">Communications in Combinatorics & Optimization</searchLink>. Sep2025, Vol. 10 Issue 3, p681-693. 13p.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=asn&AN=182994824
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.22049/cco.2024.29025.1815
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 13
        StartPage: 681
    Titles:
      – TitleFull: Strong k-transitive oriented graphs with large minimum degree.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Daamouch, Moussa
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: Sep2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 25382128
          Numbering:
            – Type: volume
              Value: 10
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Communications in Combinatorics & Optimization
              Type: main
ResultId 1