{"id":"https://openalex.org/W2050665375","doi":"https://doi.org/10.1016/s0012-365x(00)00374-5","title":"Countable \u03b1-extendable graphs","display_name":"Countable \u03b1-extendable graphs","publication_year":2001,"publication_date":"2001-08-01","ids":{"openalex":"https://openalex.org/W2050665375","doi":"https://doi.org/10.1016/s0012-365x(00)00374-5","mag":"2050665375"},"language":"en","primary_location":{"id":"doi:10.1016/s0012-365x(00)00374-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0012-365x(00)00374-5","pdf_url":null,"source":{"id":"https://openalex.org/S18902827","display_name":"Discrete Mathematics","issn_l":"0012-365X","issn":["0012-365X","1872-681X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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/A5023521381","display_name":"Jean-Luc Rulli\u00e8re","orcid":null},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Luc Rulli\u00e8re","raw_affiliation_strings":["Laboratoire LaPCS, UFR de Math\u00e9matiques, Universit\u00e9 Claude Bernard, 43, Boulevard du, 11 novembre 1918, F-69622 Villeurbanne Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire LaPCS, UFR de Math\u00e9matiques, Universit\u00e9 Claude Bernard, 43, Boulevard du, 11 novembre 1918, F-69622 Villeurbanne Cedex, France","institution_ids":["https://openalex.org/I100532134"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033238040","display_name":"St\u00e9phan Thomass\u00e9","orcid":"https://orcid.org/0000-0002-7090-1790"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"St\u00e9phan Thomass\u00e9","raw_affiliation_strings":["Laboratoire LaPCS, UFR de Math\u00e9matiques, Universit\u00e9 Claude Bernard, 43, Boulevard du, 11 novembre 1918, F-69622 Villeurbanne Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire LaPCS, UFR de Math\u00e9matiques, Universit\u00e9 Claude Bernard, 43, Boulevard du, 11 novembre 1918, F-69622 Villeurbanne Cedex, France","institution_ids":["https://openalex.org/I100532134"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I100532134"],"apc_list":{"value":3000,"currency":"USD","value_usd":3000},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.17274907,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"239","issue":"1-3","first_page":"53","last_page":"67"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9962000250816345,"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.9954000115394592,"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/mathematics","display_name":"Mathematics","score":0.8648620843887329},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.7476667165756226},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7244403958320618},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.6124864220619202},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5206931829452515},{"id":"https://openalex.org/keywords/finite-graph","display_name":"Finite graph","score":0.5051756501197815},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4857921600341797},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.47439029812812805},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.4186839163303375},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40845510363578796},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.07354295253753662},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.05549928545951843}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8648620843887329},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.7476667165756226},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7244403958320618},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.6124864220619202},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5206931829452515},{"id":"https://openalex.org/C2994516854","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Finite graph","level":3,"score":0.5051756501197815},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4857921600341797},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.47439029812812805},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.4186839163303375},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40845510363578796},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.07354295253753662},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.05549928545951843},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0012-365x(00)00374-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0012-365x(00)00374-5","pdf_url":null,"source":{"id":"https://openalex.org/S18902827","display_name":"Discrete Mathematics","issn_l":"0012-365X","issn":["0012-365X","1872-681X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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":0,"referenced_works":[],"related_works":["https://openalex.org/W1496800439","https://openalex.org/W4283803822","https://openalex.org/W2070240448","https://openalex.org/W4226143152","https://openalex.org/W4300445016","https://openalex.org/W2951840364","https://openalex.org/W4287552806","https://openalex.org/W2132921321","https://openalex.org/W1541438895","https://openalex.org/W3199488824"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}