{"id":"https://openalex.org/W2078294311","doi":"https://doi.org/10.1002/1098-2418(200010/12)17:3/4<357::aid-rsa9>3.0.co;2-y","title":"The strong chromatic index ofC4-free graphs","display_name":"The strong chromatic index ofC4-free graphs","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2078294311","doi":"https://doi.org/10.1002/1098-2418(200010/12)17:3/4<357::aid-rsa9>3.0.co;2-y","mag":"2078294311"},"language":"en","primary_location":{"id":"doi:10.1002/1098-2418(200010/12)17:3/4<357::aid-rsa9>3.0.co;2-y","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1098-2418(200010/12)17:3/4<357::aid-rsa9>3.0.co;2-y","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"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":"Random Structures and Algorithms","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/A5018777906","display_name":"Mohammad Mahdian","orcid":"https://orcid.org/0000-0001-6294-0039"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohammad Mahdian","raw_affiliation_strings":["Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139-4307","Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139\u20104307"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139-4307","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139\u20104307","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018777906"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":4330,"currency":"USD","value_usd":4330},"apc_paid":null,"fwci":1.3314,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.785,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"17","issue":"3-4","first_page":"357","last_page":"375"},"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.9998000264167786,"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.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T11476","display_name":"Graph theory and applications","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7168999910354614},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6824468374252319},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6795187592506409},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.6434881687164307},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.5874511003494263},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5661789774894714},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4971788227558136},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.49357783794403076},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48793646693229675},{"id":"https://openalex.org/keywords/brooks-theorem","display_name":"Brooks' theorem","score":0.48305946588516235},{"id":"https://openalex.org/keywords/critical-graph","display_name":"Critical graph","score":0.47038474678993225},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4566866159439087},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.44679924845695496},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4385499060153961},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.43397068977355957},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.41431787610054016},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.27161628007888794},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.19236135482788086},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15016406774520874},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.14405673742294312},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.13211017847061157},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.12143093347549438},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1053251326084137},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.053165286779403687}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7168999910354614},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6824468374252319},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6795187592506409},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.6434881687164307},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.5874511003494263},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5661789774894714},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4971788227558136},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.49357783794403076},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48793646693229675},{"id":"https://openalex.org/C51658606","wikidata":"https://www.wikidata.org/wiki/Q512897","display_name":"Brooks' theorem","level":5,"score":0.48305946588516235},{"id":"https://openalex.org/C167750561","wikidata":"https://www.wikidata.org/wiki/Q1789512","display_name":"Critical graph","level":5,"score":0.47038474678993225},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4566866159439087},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.44679924845695496},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4385499060153961},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.43397068977355957},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.41431787610054016},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.27161628007888794},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.19236135482788086},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15016406774520874},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.14405673742294312},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.13211017847061157},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.12143093347549438},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1053251326084137},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.053165286779403687},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/1098-2418(200010/12)17:3/4<357::aid-rsa9>3.0.co;2-y","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1098-2418(200010/12)17:3/4<357::aid-rsa9>3.0.co;2-y","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"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":"Random Structures and Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2003619291","https://openalex.org/W2036512668","https://openalex.org/W2044427170","https://openalex.org/W2048352893","https://openalex.org/W2048800330","https://openalex.org/W2065003601","https://openalex.org/W2068871408","https://openalex.org/W2149135074","https://openalex.org/W4249811006","https://openalex.org/W4251499437","https://openalex.org/W4292027191"],"related_works":["https://openalex.org/W2352363476","https://openalex.org/W824136475","https://openalex.org/W2185327546","https://openalex.org/W4311345810","https://openalex.org/W2006332923","https://openalex.org/W4235118966","https://openalex.org/W4361186694","https://openalex.org/W133702489","https://openalex.org/W2607211046","https://openalex.org/W4200211821"],"abstract_inverted_index":{"The":[0],"strong":[1,26],"chromatic":[2,27],"index":[3,28],"of":[4,12,29,32,61],"a":[5,59,76,86],"graph":[6,31],"G":[7],"is":[8,36,70],"the":[9,25,80],"minimum":[10],"number":[11],"induced":[13],"matchings":[14],"which":[15,55],"partition":[16],"E(G).":[17],"In":[18,40],"1985,":[19],"Erd\u0151s":[20],"and":[21,85],"Ne\u0161et\u0159il":[22],"conjectured":[23],"that":[24,67],"every":[30],"maximum":[33],"degree":[34],"\u0394":[35],"at":[37],"most":[38],"(5/4)\u03942.":[39],"this":[41],"paper,":[42],"we":[43,65],"use":[44],"probabilistic":[45],"method":[46],"to":[47,75],"prove":[48],"an":[49],"asymptotically":[50,71],"better":[51],"result":[52],"for":[53],"graphs":[54],"do":[56],"not":[57],"have":[58],"cycle":[60],"length":[62],"4.":[63],"Also,":[64],"show":[66],"our":[68],"bound":[69],"best":[72],"possible,":[73],"up":[74],"constant":[77],"multiple.":[78],"At":[79],"end,":[81],"some":[82],"open":[83],"problems":[84],"conjecture":[87],"are":[88],"stated.":[89],"\u00a9":[90],"2000":[91,102],"John":[92],"Wiley":[93],"&":[94],"Sons,":[95],"Inc.":[96],"Random":[97],"Struct.":[98],"Alg.,":[99],"17:":[100],"357\u2013375,":[101]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-13T08:25:38.343686","created_date":"2025-10-10T00:00:00"}