{"id":"https://openalex.org/W41478491","doi":"https://doi.org/10.1007/pl00021179","title":"The 2-Pebbling Property and a Conjecture of Graham's","display_name":"The 2-Pebbling Property and a Conjecture of Graham's","publication_year":2000,"publication_date":"2000-06-01","ids":{"openalex":"https://openalex.org/W41478491","doi":"https://doi.org/10.1007/pl00021179","mag":"41478491"},"language":"en","primary_location":{"id":"doi:10.1007/pl00021179","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00021179","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","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/A5040831057","display_name":"Hunter S. Snevily","orcid":null},"institutions":[{"id":"https://openalex.org/I155093810","display_name":"University of Idaho","ror":"https://ror.org/03hbp5t65","country_code":"US","type":"education","lineage":["https://openalex.org/I155093810"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hunter S. Snevily","raw_affiliation_strings":["Department of Mathematics and Statistics, University of Idaho, Moscow, ID 83844-0101, USA. e-mail: snevily@uidaho.edu, , , , , , US","\u2002Department of Mathematics and Statistics, University of Idaho, Moscow, ID 83844-0101, USA. e-mail: snevily@uidaho.edu, , US"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, University of Idaho, Moscow, ID 83844-0101, USA. e-mail: snevily@uidaho.edu, , , , , , US","institution_ids":["https://openalex.org/I155093810"]},{"raw_affiliation_string":"\u2002Department of Mathematics and Statistics, University of Idaho, Moscow, ID 83844-0101, USA. e-mail: snevily@uidaho.edu, , US","institution_ids":["https://openalex.org/I155093810"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061637086","display_name":"James A. Foster","orcid":"https://orcid.org/0000-0002-6770-6521"},"institutions":[{"id":"https://openalex.org/I155093810","display_name":"University of Idaho","ror":"https://ror.org/03hbp5t65","country_code":"US","type":"education","lineage":["https://openalex.org/I155093810"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James A. Foster","raw_affiliation_strings":["Department of Computer Science, University of Idaho, Moscow, ID 83844-0101, USA e-mail: foster@cs.uidaho.edu, , , , , , US","Department of Computer Science, University of Idaho, Moscow, ID 83844-0101, USA e-mail: foster@cs.uidaho.edu, US"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Idaho, Moscow, ID 83844-0101, USA e-mail: foster@cs.uidaho.edu, , , , , , US","institution_ids":["https://openalex.org/I155093810"]},{"raw_affiliation_string":"Department of Computer Science, University of Idaho, Moscow, ID 83844-0101, USA e-mail: foster@cs.uidaho.edu, US","institution_ids":["https://openalex.org/I155093810"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040831057"],"corresponding_institution_ids":["https://openalex.org/I155093810"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.3415,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.72405063,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"16","issue":"2","first_page":"231","last_page":"244"},"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.9994000196456909,"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.9994000196456909,"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.9993000030517578,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9932000041007996,"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.9195347428321838},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7793675661087036},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7597285509109497},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.704500138759613},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5495976209640503},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34296685457229614}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9195347428321838},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7793675661087036},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7597285509109497},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.704500138759613},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5495976209640503},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34296685457229614}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/pl00021179","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00021179","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","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":5,"referenced_works":["https://openalex.org/W74129260","https://openalex.org/W2013252038","https://openalex.org/W2055603800","https://openalex.org/W2607146678","https://openalex.org/W2911540966"],"related_works":["https://openalex.org/W3194471551","https://openalex.org/W4375956809","https://openalex.org/W1581373162","https://openalex.org/W2784911598","https://openalex.org/W4297950433","https://openalex.org/W4287023968","https://openalex.org/W4288279572","https://openalex.org/W1973978937","https://openalex.org/W4286909116","https://openalex.org/W4292635168"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}