{"id":"https://openalex.org/W4240098947","doi":"https://doi.org/10.1002/(sici)1097-0118(199902)30:2<71::aid-jgt1>3.0.co;2-g","title":"Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes","display_name":"Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes","publication_year":1999,"publication_date":"1999-02-01","ids":{"openalex":"https://openalex.org/W4240098947","doi":"https://doi.org/10.1002/(sici)1097-0118(199902)30:2<71::aid-jgt1>3.0.co;2-g"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0118(199902)30:2<71::aid-jgt1>3.0.co;2-g","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0118(199902)30:2<71::aid-jgt1>3.0.co;2-g","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/A5051487983","display_name":"Mark Ginn","orcid":null},"institutions":[{"id":"https://openalex.org/I430192","display_name":"Appalachian State University","ror":"https://ror.org/051m4vc48","country_code":"US","type":"education","lineage":["https://openalex.org/I430192"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mark Ginn","raw_affiliation_strings":["Dept. of Mathematical Sciences, Appalachian State University, Boone, NC 28608","This work was done while the author was at Dept. of Mathematics and Computer Science, Austin Peay State University, Clarksville, TN 37044"],"affiliations":[{"raw_affiliation_string":"Dept. of Mathematical Sciences, Appalachian State University, Boone, NC 28608","institution_ids":["https://openalex.org/I430192"]},{"raw_affiliation_string":"This work was done while the author was at Dept. of Mathematics and Computer Science, Austin Peay State University, Clarksville, TN 37044","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5051487983"],"corresponding_institution_ids":["https://openalex.org/I430192"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.40980985,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"30","issue":"2","first_page":"71","last_page":"76"},"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.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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.8335826396942139},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7104493975639343},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6608338356018066},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.6030991077423096},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.580514132976532},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.571185290813446},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5582637190818787},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.49789881706237793},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47195354104042053},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.44713470339775085},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.43537116050720215},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.4297581911087036},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.4061388373374939},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.25665491819381714},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.2204168140888214},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.16708680987358093},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.03146663308143616}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8335826396942139},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7104493975639343},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6608338356018066},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.6030991077423096},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.580514132976532},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.571185290813446},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5582637190818787},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.49789881706237793},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47195354104042053},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.44713470339775085},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.43537116050720215},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.4297581911087036},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.4061388373374939},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.25665491819381714},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.2204168140888214},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.16708680987358093},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.03146663308143616}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/(sici)1097-0118(199902)30:2<71::aid-jgt1>3.0.co;2-g","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0118(199902)30:2<71::aid-jgt1>3.0.co;2-g","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W194364005","https://openalex.org/W1979190428","https://openalex.org/W1997059040","https://openalex.org/W4229970255","https://openalex.org/W4250699352"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W2886672068","https://openalex.org/W2953496651","https://openalex.org/W3208942821","https://openalex.org/W167435155","https://openalex.org/W4285101991","https://openalex.org/W1512756268","https://openalex.org/W2789630860","https://openalex.org/W2007346569","https://openalex.org/W2053841470"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,9],"the":[3,15],"minimum":[4],"set":[5],"of":[6],"unordered":[7],"graphs":[8],"must":[10],"be":[11],"forbidden":[12],"to":[13],"get":[14],"same":[16],"graph":[17,25],"class":[18],"characterized":[19],"by":[20],"forbidding":[21],"a":[22],"single":[23],"ordered":[24],"is":[26],"infinite.":[27],"\u00a9":[28],"1999":[29,40],"John":[30],"Wiley":[31],"&":[32],"Sons,":[33],"Inc.":[34],"J":[35],"Graph":[36],"Theory":[37],"30:":[38],"71\u201376,":[39]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}