{"id":"https://openalex.org/W1592295455","doi":"https://doi.org/10.1016/s0012-365x(02)00671-4","title":"A Vizing-type theorem for matching forests","display_name":"A Vizing-type theorem for matching forests","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1592295455","doi":"https://doi.org/10.1016/s0012-365x(02)00671-4","mag":"1592295455"},"language":"en","primary_location":{"id":"doi:10.1016/s0012-365x(02)00671-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0012-365x(02)00671-4","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":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/e6b45315-8a17-43b3-8a1f-adb2d5f68e42","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083979837","display_name":"Judith Keijsper","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Judith Keijsper","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands","Department of Mathematics and Computer science, Eindhoven University of Technology, P.O. Box 513, 5600, MB, Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Department of Mathematics and Computer science, Eindhoven University of Technology, P.O. Box 513, 5600, MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5083979837"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":3000,"currency":"USD","value_usd":3000},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08092239,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"260","issue":"1-3","first_page":"211","last_page":"216"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9965999722480774,"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":0.9965999722480774,"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.9725000262260437,"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/T11476","display_name":"Graph theory and applications","score":0.9498999714851379,"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/combinatorics","display_name":"Combinatorics","score":0.8362558484077454},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8118810653686523},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.6826503872871399},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5567114353179932},{"id":"https://openalex.org/keywords/multiplicity","display_name":"Multiplicity (mathematics)","score":0.5558381080627441},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5092710256576538},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44569799304008484},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4431706666946411},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07097405195236206}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8362558484077454},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8118810653686523},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.6826503872871399},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5567114353179932},{"id":"https://openalex.org/C156004811","wikidata":"https://www.wikidata.org/wiki/Q2228257","display_name":"Multiplicity (mathematics)","level":2,"score":0.5558381080627441},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5092710256576538},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44569799304008484},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4431706666946411},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07097405195236206}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1016/s0012-365x(02)00671-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0012-365x(02)00671-4","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"},{"id":"pmh:oai:pure.tue.nl:openaire/e6b45315-8a17-43b3-8a1f-adb2d5f68e42","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/e6b45315-8a17-43b3-8a1f-adb2d5f68e42","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Keijsper, J 2003, 'A Vizing-type theorem for matching forests', Discrete Mathematics, vol. 260, no. 1-3, pp. 211-216. https://doi.org/10.1016/S0012-365X(02)00671-4","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:623566","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=623566","pdf_url":null,"source":{"id":"https://openalex.org/S4306400553","display_name":"Munich Personal RePEc Archive (Ludwig Maximilian University of Munich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I8204097","host_organization_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","host_organization_lineage":["https://openalex.org/I8204097"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0012-365X","raw_type":null},{"id":"pmh:oai:library.tue.nl:623566","is_oa":false,"landing_page_url":"http://repository.tue.nl/623566","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0012-365X","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/77253025-9faa-4adf-8be0-7a29e4be40f1","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/77253025-9faa-4adf-8be0-7a29e4be40f1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Keijsper, J C M 2000, A vizing-type theorem for matching forests. University of Twente, Enschede.","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:tue:oai:pure.tue.nl:publications/0ae38a5a-f75c-4670-9be4-c7476f0515da","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/0ae38a5a-f75c-4670-9be4-c7476f0515da","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:tue:oai:pure.tue.nl:publications/e6b45315-8a17-43b3-8a1f-adb2d5f68e42","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/e6b45315-8a17-43b3-8a1f-adb2d5f68e42","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Mathematics, 260(1-3), 211 - 216. Elsevier","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:ut:oai:ris.utwente.nl:publications/42e16806-cc1f-4b3f-9e47-741a6019fdf3","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/42e16806-cc1f-4b3f-9e47-741a6019fdf3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:ut:oai:ris.utwente.nl:publications/77253025-9faa-4adf-8be0-7a29e4be40f1","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/a-vizingtype-theorem-for-matching-forests(77253025-9faa-4adf-8be0-7a29e4be40f1).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/report"},{"id":"mag:1592295455","is_oa":false,"landing_page_url":"https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2F0ae38a5a-f75c-4670-9be4-c7476f0515da","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/e6b45315-8a17-43b3-8a1f-adb2d5f68e42","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/e6b45315-8a17-43b3-8a1f-adb2d5f68e42","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Keijsper, J 2003, 'A Vizing-type theorem for matching forests', Discrete Mathematics, vol. 260, no. 1-3, pp. 211-216. https://doi.org/10.1016/S0012-365X(02)00671-4","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land","score":0.7099999785423279}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2037988115"],"related_works":["https://openalex.org/W1995597112","https://openalex.org/W2918304211","https://openalex.org/W2605718691","https://openalex.org/W3003487239","https://openalex.org/W2373049971","https://openalex.org/W1508022883","https://openalex.org/W205329642","https://openalex.org/W197923251","https://openalex.org/W2938065645","https://openalex.org/W2997928242","https://openalex.org/W1995420362","https://openalex.org/W2898925044","https://openalex.org/W2018537445","https://openalex.org/W2951829205","https://openalex.org/W3203773772","https://openalex.org/W2026018777","https://openalex.org/W1888521704","https://openalex.org/W2759473724","https://openalex.org/W2158850746","https://openalex.org/W1221537183"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-05-23T08:51:43.019350","created_date":"2025-10-10T00:00:00"}