{"id":"https://openalex.org/W4236734648","doi":"https://doi.org/10.1002/(sici)1097-0118(200001)33:1<32::aid-jgt4>3.0.co;2-y","title":"On the perfect orderability of unions of two graphs","display_name":"On the perfect orderability of unions of two graphs","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W4236734648","doi":"https://doi.org/10.1002/(sici)1097-0118(200001)33:1<32::aid-jgt4>3.0.co;2-y"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0118(200001)33:1<32::aid-jgt4>3.0.co;2-y","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0118(200001)33:1<32::aid-jgt4>3.0.co;2-y","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060428317","display_name":"Ch\ufffdnh T. Ho\ufffdng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ch\ufffdnh T. Ho\ufffdng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5046890465","display_name":"Xiaodan Tu","orcid":null},"institutions":[{"id":"https://openalex.org/I72541430","display_name":"Lakehead University","ror":"https://ror.org/023p7mg82","country_code":"CA","type":"education","lineage":["https://openalex.org/I72541430"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Xiaodan Tu","raw_affiliation_strings":["School of Mathematical Sciences, Lakehead University, Thunder Bay, Ontario, Canada P7B-5E1"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Lakehead University, Thunder Bay, Ontario, Canada P7B-5E1","institution_ids":["https://openalex.org/I72541430"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.4655,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.72345826,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"1","first_page":"32","last_page":"43"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.840684175491333},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8026760816574097},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.6268436312675476},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.6239603757858276},{"id":"https://openalex.org/keywords/perfect-graph","display_name":"Perfect graph","score":0.5724644064903259},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.5435760021209717},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.5197315216064453},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4894672632217407},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.45288729667663574},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4365957975387573},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4156959354877472},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.41481202840805054},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3978063762187958},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3284314274787903},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.28577470779418945},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2493494153022766},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.21530145406723022},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.06331241130828857}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.840684175491333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8026760816574097},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.6268436312675476},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.6239603757858276},{"id":"https://openalex.org/C32972407","wikidata":"https://www.wikidata.org/wiki/Q1187620","display_name":"Perfect graph","level":5,"score":0.5724644064903259},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.5435760021209717},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.5197315216064453},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4894672632217407},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.45288729667663574},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4365957975387573},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4156959354877472},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.41481202840805054},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3978063762187958},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3284314274787903},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.28577470779418945},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2493494153022766},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.21530145406723022},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.06331241130828857}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/(sici)1097-0118(200001)33:1<32::aid-jgt4>3.0.co;2-y","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0118(200001)33:1<32::aid-jgt4>3.0.co;2-y","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"},{"id":"pmh:oai:collectionscanada.gc.ca:OOAMICUS.21132645","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402307","display_name":"Library and Archives Canada (Government of Canada)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2802286613","host_organization_name":"Government of Canada","host_organization_lineage":["https://openalex.org/I2802286613"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Electronic thesis or dissertation"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W163386900","https://openalex.org/W1963780543","https://openalex.org/W1977997947","https://openalex.org/W2015769804","https://openalex.org/W2054018224","https://openalex.org/W2064063612","https://openalex.org/W2082068582","https://openalex.org/W2320198223","https://openalex.org/W4213116309"],"related_works":["https://openalex.org/W2065306274","https://openalex.org/W2914244779","https://openalex.org/W199404365","https://openalex.org/W2006942360","https://openalex.org/W3153161399","https://openalex.org/W2085422823","https://openalex.org/W2047104722","https://openalex.org/W1555810828","https://openalex.org/W1999463304","https://openalex.org/W4287995448"],"abstract_inverted_index":{"A":[0,34,51],"graph":[1,35,63],"G":[2,92,103],"is":[3,36,64,69,93,104,165],"perfectly":[4,65,105,166],"orderable,":[5,66],"if":[6,40,67,91,145],"it":[7,41,68],"admits":[8],"an":[9,22],"order":[10],"<":[11],"on":[12,25],"its":[13],"vertices":[14,129],"such":[15],"that":[16,61,118,153],"the":[17,70,84,94,119,122,159],"sequential":[18],"coloring":[19,24],"algorithm":[20],"delivers":[21],"optimum":[23],"each":[26],"induced":[27,49],"subgraph":[28],"(H,":[29],"<)":[30],"of":[31,53,72,83,96,121,143,161],"(G,":[32],"<).":[33],"a":[37,62,132,140],"threshold":[38,74],"graph,":[39],"contains":[42],"no":[43],"P4,":[44],"2K2,":[45],"and":[46,57,100,109,114,137,147,156,163],"C4":[47],"as":[48],"subgraph.":[50],"theorem":[52],"Chv\u00e1tal,":[54],"Ho\u00e0ng,":[55],"Mahadev,":[56],"de":[58],"Werra":[59],"states":[60],"union":[71,95,160],"two":[73,97,150],"graphs.":[75],"In":[76],"this":[77,135],"article,":[78],"we":[79,138],"investigate":[80],"possible":[81],"generalizations":[82],"above":[85],"theorem.":[86],"Ho\u00e0ng":[87],"has":[88],"conjectured":[89],"that,":[90],"graphs":[98,152],"G1":[99,108,146,162],"G2,":[101],"then":[102,158],"orderable":[106],"whenever":[107],"G2":[110,148,164],"are":[111,149,154],"both":[112],"P4-free":[113,155],"2K2-free.":[115],"We":[116],"show":[117],"complement":[120],"chordless":[123],"cycle":[124],"with":[125],"at":[126],"least":[127],"five":[128],"cannot":[130],"be":[131],"counter-example":[133],"to":[134],"conjecture,":[136],"prove":[139],"special":[141],"case":[142],"it:":[144],"edge-disjoint":[151],"2K2-free,":[157],"orderable.":[167],"\u00a9":[168],"2000":[169,180],"John":[170],"Wiley":[171],"&":[172],"Sons,":[173],"Inc.":[174],"J":[175],"Graph":[176],"Theory":[177],"33:":[178],"32\u201343,":[179]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}