1 Ocak 2022 Dergi makalesi Açık Erişim

Buyukcolak, Yasemin; Ozkan, Sibel; Gozupek, Didem

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
    <subfield code="o">oai:aperta.ulakbim.gov.tr:236434</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">A graph is called equimatchable if all of its maximal matchings have the same size. Frendrup et al. provided a characterization of equimatchable graphs with girth at least 5. In this paper, we extend this result by providing a complete structural characterization of equimatchable graphs with girth at least 4, that is, equimatchable graphs with no triangle, by identifying the equimatchable triangle-free graph families. Our characterization also extends the result given by Akbari et al., which proves that the only connected triangle-free equimatchable r-regular graphs are C 5, C 7, and K r , r, where r is a positive integer. Given a nonbipartite graph, our characterization implies a linear time recognition algorithm for triangle-free equimatchable graphs.</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Creative Commons Attribution</subfield>
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Buyukcolak, Yasemin</subfield>
    <subfield code="u">Gebze Tech Univ, Dept Math, TR-41400 Kocaeli, Turkey</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:c45cd5a1a877cf0e7bee6ed2265aa515</subfield>
    <subfield code="s">124</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/236434/files/bib-c2747675-59d4-4ad2-9900-e3112336caea.txt</subfield>
  </datafield>
  <controlfield tag="005">20221007093927.0</controlfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2022-01-01</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1002/jgt.22750</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Triangle-free equimatchable graphs</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="v">99</subfield>
    <subfield code="p">JOURNAL OF GRAPH THEORY</subfield>
    <subfield code="c">461-484</subfield>
    <subfield code="n">3</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Ozkan, Sibel</subfield>
    <subfield code="u">Gebze Tech Univ, Dept Math, TR-41400 Kocaeli, Turkey</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Gozupek, Didem</subfield>
    <subfield code="u">Gebze Tech Univ, Dept Comp Engn, Kocaeli, Turkey</subfield>
  </datafield>
  <controlfield tag="001">236434</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
</record>