{"id":"https://openalex.org/W1594220042","doi":"https://doi.org/10.37236/705","title":"A Note on Path Factors of $(3,4)$-Biregular Bipartite Graphs","display_name":"A Note on Path Factors of $(3,4)$-Biregular Bipartite Graphs","publication_year":2011,"publication_date":"2011-11-14","ids":{"openalex":"https://openalex.org/W1594220042","doi":"https://doi.org/10.37236/705","mag":"1594220042"},"language":"en","primary_location":{"id":"doi:10.37236/705","is_oa":true,"landing_page_url":"https://doi.org/10.37236/705","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p218/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p218/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032321308","display_name":"Carl Johan Casselgren","orcid":"https://orcid.org/0000-0002-2741-468X"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Carl Johan Casselgren","raw_affiliation_strings":["Department of Mathematics Ume University SE-901 87 Ume, Sweden","Umea University"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics Ume University SE-901 87 Ume, Sweden","institution_ids":["https://openalex.org/I90267481"]},{"raw_affiliation_string":"Umea University","institution_ids":["https://openalex.org/I90267481"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032321308"],"corresponding_institution_ids":["https://openalex.org/I90267481"],"apc_list":null,"apc_paid":null,"fwci":0.3214,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.57318766,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"18","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9998999834060669,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.9111064672470093},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7811471223831177},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7504382729530334},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.6911295652389526},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.6535370945930481},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.5865774154663086},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.5320385694503784},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.4971051514148712},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.49302956461906433},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46797803044319153},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.416778564453125},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.371574342250824},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2162107229232788}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9111064672470093},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7811471223831177},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7504382729530334},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.6911295652389526},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.6535370945930481},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.5865774154663086},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.5320385694503784},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.4971051514148712},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.49302956461906433},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46797803044319153},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.416778564453125},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.371574342250824},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2162107229232788}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/705","is_oa":true,"landing_page_url":"https://doi.org/10.37236/705","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p218/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.372.6442","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.372.6442","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/ojs/index.php/eljc/article/viewFile/v18i1p218/pdf/","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/705","is_oa":true,"landing_page_url":"https://doi.org/10.37236/705","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p218/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1594220042.pdf","grobid_xml":"https://content.openalex.org/works/W1594220042.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W38947130","https://openalex.org/W164191045","https://openalex.org/W345637930","https://openalex.org/W1484040084","https://openalex.org/W2001298633","https://openalex.org/W2005967205","https://openalex.org/W2018072810","https://openalex.org/W2072054417","https://openalex.org/W2075839686","https://openalex.org/W2082350456","https://openalex.org/W2087162634","https://openalex.org/W2097936723","https://openalex.org/W2595145913","https://openalex.org/W4246619488","https://openalex.org/W4300303686"],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W4291316360","https://openalex.org/W398688634","https://openalex.org/W4225909815","https://openalex.org/W2903114345","https://openalex.org/W3150304134","https://openalex.org/W2151059773","https://openalex.org/W1602536203","https://openalex.org/W2950062088","https://openalex.org/W2012810027"],"abstract_inverted_index":{"A":[0,28],"proper":[1],"edge":[2],"coloring":[3,15],"of":[4],"a":[5,65,69,106,118,124],"graph":[6,30,66,103,122],"$G$":[7,67,89],"with":[8,23,76,132],"colors":[9,18],"$1,2,3,\\dots$":[10],"is":[11,31],"called":[12],"an":[13,91],"interval":[14,92],"if":[16,33,63],"the":[17,20,46],"on":[19],"edges":[21],"incident":[22],"any":[24],"vertex":[25],"are":[26,74,129],"consecutive.":[27],"bipartite":[29,102,121],"$(3,4)$-biregular":[32,101,120],"all":[34,43],"vertices":[35,44,80,136],"in":[36,45,83],"one":[37],"part":[38,48],"have":[39,49],"degree":[40,50],"$3$":[41],"and":[42,81,137],"other":[47],"$4$.":[51],"Recently":[52],"it":[53],"was":[54,95],"proved":[55],"[J.":[56],"Graph":[57],"Theory":[58],"61":[59],"(2009),":[60],"88-97]":[61],"that":[62,98,117],"such":[64,105],"has":[68,90,104,123],"spanning":[70,125],"subgraph":[71,126],"whose":[72,127],"components":[73,128],"paths":[75,131],"endpoints":[77,133],"at":[78,134],"3-valent":[79],"lengths":[82,138],"$\\{2,":[84],"4,":[85],"6,":[86],"8\\}$,":[87],"then":[88],"coloring.":[93],"It":[94],"also":[96],"conjectured":[97],"every":[99],"simple":[100,119],"subgraph.":[107],"We":[108],"provide":[109],"some":[110],"evidence":[111],"for":[112],"this":[113],"conjecture":[114],"by":[115],"proving":[116],"nontrivial":[130],"$3$-valent":[135],"not":[139],"exceeding":[140],"$22$.":[141]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}