<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-J2K09WER</identifier><date>2026</date><creator>Scheffler, Robert</creator><relation>documents/doc/J/URN_NBN_SI_doc-J2K09WER_001.pdf</relation><relation>documents/doc/J/URN_NBN_SI_doc-J2K09WER_001.txt</relation><relation>documents/doc/J/URN_NBN_SI_doc-J2K09WER_002.pdf</relation><relation>documents/doc/J/URN_NBN_SI_doc-J2K09WER_002.txt</relation><format format_type="issue">1, article  p1.08</format><format format_type="volume">26</format><format format_type="type">article</format><format format_type="extent">str. 1-29</format><identifier identifier_type="DOI">10.26493/1855-3974.3238.2a8</identifier><identifier identifier_type="ISSN">1855-3974</identifier><identifier identifier_type="COBISSID_HOST">288373763</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-J2K09WER</identifier><language>eng</language><publisher publisher_location="Koper">Univerza na Primorskem</publisher><source>Ars mathematica contemporanea</source><rights>BY</rights><subject language_type_id="slv">akordni grafi</subject><subject language_type_id="eng">chordal graphs</subject><subject language_type_id="eng">graph search</subject><subject language_type_id="eng">graph search trees</subject><subject language_type_id="slv">iskalna drevesa grafov</subject><subject language_type_id="slv">iskanje v grafu</subject><subject language_type_id="eng">leaves</subject><subject language_type_id="slv">listi</subject><title>On the leaves of graph search trees</title></Record>