<?xml version="1.0" encoding="UTF-8"?>
<doi_batch version="5.3.1" xmlns="http://www.crossref.org/schema/5.3.1" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:jats="http://www.ncbi.nlm.nih.gov/JATS1" xmlns:ai="http://www.crossref.org/AccessIndicators.xsd" xsi:schemaLocation="http://www.crossref.org/schema/5.3.1 http://www.crossref.org/schema/deposit/crossref5.3.1.xsd">
 <head>
  <doi_batch_id>aspg-33-3851-1792223571</doi_batch_id>
  <timestamp>20261017075251</timestamp>
  <depositor>
   <depositor_name>American Scientific Publishing Group</depositor_name>
   <email_address>admin@americaspg.com</email_address>
  </depositor>
  <registrant>American Scientific Publishing Group</registrant>
 </head>
 <body>
  <journal>
   <journal_metadata language="en">
    <full_title>Galoitica: Journal of Mathematical Structures and Applications</full_title>
    <abbrev_title>GJMSA</abbrev_title>
    <issn media_type="electronic">2834-5568</issn>
   </journal_metadata>
   <journal_issue>
    <publication_date media_type="online">
     <year>2025</year>
    </publication_date>
    <journal_volume>
     <volume>12</volume>
    </journal_volume>
    <issue>1</issue>
   </journal_issue>
   <journal_article publication_type="full_text">
    <titles>
     <title>Linear-Branch-Decomposition of Digraph</title>
    </titles>
    <contributors>
     <person_name sequence="first" contributor_role="author">
      <given_name>Takaaki</given_name>
      <surname>Fujita</surname>
      <affiliations>
       <institution>
        <institution_name>Independent Researcher, Shinjuku, Shinjuku-ku, Tokyo, Japan</institution_name>
       </institution>
      </affiliations>
     </person_name>
    </contributors>
    <jats:abstract>
     <jats:p>The study of graph width parameters is a well-established field within graph theory. Recently, numerous researchers have been actively extending undirected width parameters to directed graphs, resulting in a wide range of studies on directed width parameters. In this paper, we introduce a new concept called Directed Linear-Branch-Width, which extends the (Undirected) Linear-Branch-Width to digraphs. We also investigate its relationship and hierarchy with Directed Path-width, Directed Cut-width, and Directed Neighbourhood- width</jats:p>
    </jats:abstract>
    <publication_date media_type="online">
     <year>2025</year>
    </publication_date>
    <pages>
     <first_page>24</first_page>
     <last_page>35</last_page>
    </pages>
    <publisher_item>
     <item_number item_number_type="article-number">3851</item_number>
    </publisher_item>
    <ai:program name="AccessIndicators">
     <ai:license_ref applies_to="vor">https://creativecommons.org/licenses/by/4.0/</ai:license_ref>
    </ai:program>
    <doi_data>
     <doi>10.54216/GJMSA.0120104</doi>
     <resource>https://americaspg.com/journal/33/article/3851</resource>
     <collection property="text-mining">
      <item>
       <resource mime_type="application/pdf">https://americaspg.com/storage/21746789426.pdf</resource>
      </item>
     </collection>
    </doi_data>
   </journal_article>
  </journal>
 </body>
</doi_batch>
