{"id":"https://openalex.org/W1969119072","doi":"https://doi.org/10.1137/110829222","title":"On $3$-Colorable $P_5$-Free Graphs","display_name":"On $3$-Colorable $P_5$-Free Graphs","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1969119072","doi":"https://doi.org/10.1137/110829222","mag":"1969119072"},"language":"id","primary_location":{"id":"doi:10.1137/110829222","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110829222","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5064579274","display_name":"Fr\u00e9d\u00e9ric Maffray","orcid":"https://orcid.org/0000-0002-8265-0415"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Fr\u00e9d\u00e9ric Maffray","raw_affiliation_strings":["Optimisation Combinatoire"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Optimisation Combinatoire","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108821154","display_name":"Gr\u00e9gory Morel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gr\u00e9gory Morel","raw_affiliation_strings":["Optimisation Combinatoire"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Optimisation Combinatoire","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064579274"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.472,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.92337389,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"26","issue":"4","first_page":"1682","last_page":"1708"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8031602501869202},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7866543531417847},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.6565116047859192},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.6395989060401917},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.61427241563797},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5905635952949524},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.5826916694641113},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5501440763473511},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.49977993965148926},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4937807023525238},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4613926410675049},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.46070611476898193},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4493364691734314},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.44726625084877014},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43394869565963745},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.4137040674686432},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3089137673377991},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.29000771045684814},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2560030221939087},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.15768694877624512},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11172553896903992}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8031602501869202},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7866543531417847},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.6565116047859192},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.6395989060401917},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.61427241563797},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5905635952949524},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.5826916694641113},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5501440763473511},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.49977993965148926},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4937807023525238},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4613926410675049},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.46070611476898193},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4493364691734314},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.44726625084877014},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43394869565963745},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.4137040674686432},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3089137673377991},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.29000771045684814},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2560030221939087},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.15768694877624512},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11172553896903992},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110829222","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110829222","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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":12,"referenced_works":["https://openalex.org/W1991477862","https://openalex.org/W1993627148","https://openalex.org/W1993788757","https://openalex.org/W2000763343","https://openalex.org/W2030973065","https://openalex.org/W2059639406","https://openalex.org/W2092129537","https://openalex.org/W2170633983","https://openalex.org/W2282776087","https://openalex.org/W2913398500","https://openalex.org/W4240804599","https://openalex.org/W4252143234"],"related_works":["https://openalex.org/W2041022284","https://openalex.org/W3008087224","https://openalex.org/W1996812986","https://openalex.org/W63807318","https://openalex.org/W2898526288","https://openalex.org/W2955903066","https://openalex.org/W2607123191","https://openalex.org/W1968027460","https://openalex.org/W2088153883","https://openalex.org/W4283803822"],"abstract_inverted_index":{"A":[0],"graph":[1,95],"is":[2,27,82],"$P_5$-free":[3,25,55,94],"when":[4],"it":[5],"does":[6],"not":[7],"contain":[8],"a":[9,13,59,70,86,92],"$P_5$":[10],"(that":[11],"is,":[12],"path":[14],"with":[15,32],"five":[16],"vertices)":[17],"as":[18],"an":[19],"induced":[20],"subgraph.":[21],"The":[22],"class":[23,52],"of":[24,28,40,53,62,65,91],"graphs":[26,67],"particular":[29],"interest,":[30],"especially":[31],"respect":[33],"to":[34,84],"the":[35,41,51,63,80],"still":[36],"unknown":[37],"complexity":[38],"status":[39],"maximum":[42,87],"stable":[43,89],"set":[44,90],"problem":[45],"in":[46,76,96],"that":[47,73],"class.":[48,78],"We":[49,57],"investigate":[50],"$3$-colorable":[54,93],"graphs.":[56],"give":[58],"complete":[60],"description":[61],"structure":[64],"those":[66],"and":[68],"derive":[69],"linear-time":[71],"algorithm":[72,81],"tests":[74],"membership":[75],"this":[77],"Moreover,":[79],"able":[83],"find":[85],"weight":[88],"linear":[97],"time.":[98]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2}],"updated_date":"2026-06-07T08:38:57.713557","created_date":"2025-10-10T00:00:00"}