<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0410159</ARLID> <utime>20240103182154.9</utime><mtime>20060210235959.9</mtime>        <title language="eng" primary="1">A graphical characterization of the largest chain graphs</title>  <specification> <page_count>28 s.</page_count> </specification>   <serial><ARLID>cav_un_epca*0256774</ARLID><ISSN>0888-613X</ISSN><title>International Journal of Approximate Reasoning</title><part_num/><part_title/><volume_id>20</volume_id><volume>3 (1999)</volume><page_num>209-236</page_num><publisher><place/><name>Elsevier</name><year/></publisher></serial>   <author primary="1"> <ARLID>cav_un_auth*0212565</ARLID> <name1>Volf</name1> <name2>M.</name2> <country>CZ</country>  </author> <author primary="0"> <ARLID>cav_un_auth*0101202</ARLID> <name1>Studený</name1> <name2>Milan</name2> <institution>UTIA-B</institution> <full_dept>Department of Decision Making Theory</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>     <COSATI>12A</COSATI>    <cas_special> <project> <project_id>GA201/98/0478</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0005907</ARLID> </project> <research> <research_id>AV0Z1075907</research_id> </research>     <RIV>BA</RIV>      <department>MTR</department>   <permalink>http://hdl.handle.net/11104/0130251</permalink>   <ID_orig>UTIA-B 990143</ID_orig>       <arlyear>1999</arlyear>       <unknown tag="mrcbU63"> cav_un_epca*0256774 International Journal of Approximate Reasoning 0888-613X 1873-4731 Roč. 20 č. 3 1999 209 236 Elsevier </unknown> </cas_special> </bibitem>