{"id":"W3003210829","doi":"10.1016/j.amc.2020.125032","title":"On the vertex partition of planar graphs into forests with bounded degree","year":2020,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Frequency partition of a graph; Combinatorics; Partition (number theory); Mathematics; Bounded function; Planar graph; Vertex (graph theory); Discrete mathematics; Degree (music); Graph; Graph power; Line graph; Physics; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001350459,0.0009295138,0.001357461,0.002088582,0.001637876,0.003605302,0.00212255,0.001499049,0.007397053],"category_scores_gemma":[0.009918234,0.0008363214,0.0009186565,0.002229686,0.003621916,0.006673371,0.00239453,0.002605853,0.0007395328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001896902,"about_ca_system_score_gemma":0.000707007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004048106,"about_ca_topic_score_gemma":0.004682609,"domain_scores_codex":[0.9991676,0.0003033239,0.00002624708,0.0001501292,0.0001525818,0.0002001794],"domain_scores_gemma":[0.9904699,0.007595025,0.0005564805,0.0005014801,0.0003779853,0.0004990667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007787989,0.0001342348,0.002391509,0.0003252757,0.00006843336,0.0002025366,0.0009509517,0.07554334,0.005587396,0.8677297,0.01105469,0.03523317],"study_design_scores_gemma":[0.00005102508,0.00004262499,0.0009579039,0.00005009675,0.00003329022,0.00008814812,0.0002684893,0.1053116,0.0006852499,0.8905529,0.00193833,0.00002034247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.68136,0.004404662,0.2597004,0.005584916,0.000300424,0.00009736008,0.0008931567,0.0003704933,0.04728865],"genre_scores_gemma":[0.9322593,0.002839791,0.04666166,0.001078583,0.000626847,0.0001286156,0.001369592,0.0003972542,0.01463848],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007397053,"threshold_uncertainty_score":0.02474564,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0406424360618284,"score_gpt":0.2698146439078508,"score_spread":0.2291722078460224,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}