{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T11:44:08Z","timestamp":1697888648118},"reference-count":13,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7437,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1986,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A formal analysis is made of the interconnection between oriented graphs and their underlying graphs, illustrating more general situations such as underlying graphs of networks. A natural notion of an \u201cunderlying property\u201d is presented and illustrated, supporting a syntactical principle appropriate to the detection of false digraph\u2010theoretic conjectures.<\/jats:p>","DOI":"10.1002\/net.3230160206","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T20:50:14Z","timestamp":1178916614000},"page":"175-180","source":"Crossref","is-referenced-by-count":0,"title":["Underlying properties of oriented graphs"],"prefix":"10.1002","volume":"16","author":[{"given":"T. A.","family":"McKee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Graphs & Digraphs","author":"Behzad M.","year":"1979"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-14.2.277"},{"key":"e_1_2_1_4_2","first-page":"115","volume-title":"On directed paths and circuits. I. Theory of Graphs","author":"Gallai T.","year":"1968"},{"key":"e_1_2_1_5_2","first-page":"1370","article-title":"Characterisation des graphes non orientes dont on peut orienter les aretes de maniere a obtenir le graphe d'une relation d'order","volume":"254","author":"Ghouila\u2010Houri A.","year":"1962","journal-title":"C. R. Acad. Sci. Paris"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1964-055-5"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(77)90049-1"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/mana.19650280503"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70035-9"},{"key":"e_1_2_1_10_2","volume-title":"Introduction to Mathematical Logic","author":"Mendelson E.","year":"1979"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.2307\/2310826"},{"key":"e_1_2_1_12_2","first-page":"133","volume-title":"Well\u2010balanced orientations of finite graphs and unobtrusive odd\u2010vertex\u2010pairings. I. Recent Progress in Combinatorics","author":"Nash\u2010Williams C. St. J. A.","year":"1968"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.2307\/2303897"},{"key":"e_1_2_1_14_2","first-page":"127","article-title":"Nombre chromatique et plus longs chemins d'un graphe","volume":"1","author":"Roy B.","year":"1967","journal-title":"Rev. Francaise Automat. Informat. Recherche Operationnelle"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230160206","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230160206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T01:54:26Z","timestamp":1697853266000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230160206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["10.1002\/net.3230160206"],"URL":"https:\/\/doi.org\/10.1002\/net.3230160206","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}