{"id":"https://openalex.org/W2999141835","doi":"https://doi.org/10.37236/1704","title":"On $k$-Ordered Bipartite Graphs","display_name":"On $k$-Ordered Bipartite Graphs","publication_year":2003,"publication_date":"2003-04-15","ids":{"openalex":"https://openalex.org/W2999141835","doi":"https://doi.org/10.37236/1704","mag":"2999141835"},"language":"en","primary_location":{"id":"doi:10.37236/1704","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1704","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v10i1r11/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v10i1r11/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103342231","display_name":"Jill R. Faudree","orcid":null},"institutions":[{"id":"https://openalex.org/I141472210","display_name":"University of Alaska Fairbanks","ror":"https://ror.org/01j7nq853","country_code":"US","type":"education","lineage":["https://openalex.org/I141472210"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jill R. Faudree","raw_affiliation_strings":["University of Alaska Fairbanks Fairbanks, AK 99775"],"affiliations":[{"raw_affiliation_string":"University of Alaska Fairbanks Fairbanks, AK 99775","institution_ids":["https://openalex.org/I141472210"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077689134","display_name":"Ronald J. Gould","orcid":"https://orcid.org/0000-0003-0040-9511"},"institutions":[{"id":"https://openalex.org/I150468666","display_name":"Emory University","ror":"https://ror.org/03czfpz43","country_code":"US","type":"education","lineage":["https://openalex.org/I150468666"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ronald J. Gould","raw_affiliation_strings":["Emory University Atlanta, GA 30322"],"affiliations":[{"raw_affiliation_string":"Emory University Atlanta, GA 30322","institution_ids":["https://openalex.org/I150468666"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039554856","display_name":"Florian Pfender","orcid":"https://orcid.org/0000-0002-0124-3421"},"institutions":[{"id":"https://openalex.org/I150468666","display_name":"Emory University","ror":"https://ror.org/03czfpz43","country_code":"US","type":"education","lineage":["https://openalex.org/I150468666"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Florian Pfender","raw_affiliation_strings":["Emory University Atlanta, GA 30322"],"affiliations":[{"raw_affiliation_string":"Emory University Atlanta, GA 30322","institution_ids":["https://openalex.org/I150468666"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112617565","display_name":"Allison Wolf","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Allison Wolf","raw_affiliation_strings":["College of Computing Georgia Institute of Technology Atlanta, GA 30332"],"affiliations":[{"raw_affiliation_string":"College of Computing Georgia Institute of Technology Atlanta, GA 30332","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5103342231"],"corresponding_institution_ids":["https://openalex.org/I141472210"],"apc_list":null,"apc_paid":null,"fwci":2.2005,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.87041688,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"10","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9993000030517578,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9959999918937683,"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.8956321477890015},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.855951726436615},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8229641914367676},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6848035454750061},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.5486763119697571},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.5078030228614807},{"id":"https://openalex.org/keywords/pancyclic-graph","display_name":"Pancyclic graph","score":0.4980430603027344},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47756630182266235},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4708901047706604},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.4345543384552002},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.175663560628891},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.07776898145675659}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8956321477890015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.855951726436615},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8229641914367676},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6848035454750061},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.5486763119697571},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.5078030228614807},{"id":"https://openalex.org/C166911692","wikidata":"https://www.wikidata.org/wiki/Q7130424","display_name":"Pancyclic graph","level":5,"score":0.4980430603027344},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47756630182266235},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4708901047706604},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.4345543384552002},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.175663560628891},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.07776898145675659},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.37236/1704","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1704","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v10i1r11/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.4636","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.4636","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_10/PostScriptfiles/v10i1r11.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.6.2087","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.2087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_10/PDF/v10i1r11.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.720.8366","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.720.8366","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.ucdenver.edu/%7Efpfender/papers/25.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/1704","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1704","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v10i1r11/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2999141835.pdf","grobid_xml":"https://content.openalex.org/works/W2999141835.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W1969919767","https://openalex.org/W2082268829","https://openalex.org/W2612978016","https://openalex.org/W3149772931","https://openalex.org/W4245518162"],"related_works":["https://openalex.org/W2962785705","https://openalex.org/W1979242696","https://openalex.org/W2064737922","https://openalex.org/W2057580655","https://openalex.org/W1978219832","https://openalex.org/W1534832295","https://openalex.org/W2319833372","https://openalex.org/W1735997119","https://openalex.org/W2069626737","https://openalex.org/W4239816308"],"abstract_inverted_index":{"In":[0],"1997,":[1],"Ng":[2],"and":[3,65],"Schultz":[4],"introduced":[5],"the":[6,35,38,41,45,107],"idea":[7],"of":[8,26,37,67,110],"cycle":[9,32,46],"orderability.":[10],"For":[11,83],"a":[12,16,31,49,75,88],"positive":[13,103],"integer":[14,104],"$k$,":[15,105],"graph":[17,78,91],"$G$":[18,53,86,111,117],"is":[19,30,47,54,112,118],"k-ordered":[20,58],"if":[21,106],"for":[22,70,101],"every":[23],"ordered":[24],"sequence":[25,39],"$k$":[27],"vertices,":[28,94],"there":[29],"that":[33,73,100],"encounters":[34],"vertices":[36,72],"in":[40],"given":[42],"order.":[43],"If":[44],"also":[48],"hamiltonian":[50],"cycle,":[51],"then":[52,116],"said":[55],"to":[56,79],"be":[57,80,87],"hamiltonian.":[59,82,120],"We":[60,98],"give":[61],"minimum":[62,108],"degree":[63,68,109],"conditions":[64,69],"sum":[66],"nonadjacent":[71],"imply":[74],"balanced":[76,89],"bipartite":[77,90],"$k$-ordered":[81,119],"example,":[84],"let":[85],"on":[92],"$2n$":[93],"$n$":[95],"sufficiently":[96],"large.":[97],"show":[99],"any":[102],"at":[113],"least":[114],"$(2n+k-1)/4$,":[115]},"counts_by_year":[{"year":2017,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}