{"id":"W2006186391","doi":"10.1016/j.tcs.2015.01.028","title":"Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Mathematics; Combinatorics; Injective function; Bijection; Treewidth; Homomorphism; Bounded function; Surjective function; Discrete mathematics; Algebra homomorphism; Graph; Tree-depth; 1-planar graph; Pathwidth; Chordal graph; Line graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001122106,0.0005759798,0.0009499685,0.001595998,0.00168156,0.002397503,0.002058083,0.001151689,0.006329183],"category_scores_gemma":[0.007654066,0.0008866278,0.0006558161,0.001777851,0.002016506,0.008713353,0.003390735,0.002699086,0.0007412017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001134203,"about_ca_system_score_gemma":0.0006215581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001134756,"about_ca_topic_score_gemma":0.001491586,"domain_scores_codex":[0.9987183,0.0003862403,0.00006337144,0.0003681379,0.0002355161,0.0002285301],"domain_scores_gemma":[0.990617,0.005240397,0.00111947,0.001236556,0.0004900367,0.001296527],"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.0003316855,0.0001396638,0.001124254,0.0001545197,0.00003264873,0.000282897,0.001150693,0.009493007,0.00964148,0.9573382,0.001380026,0.01893082],"study_design_scores_gemma":[0.00003981552,0.0000438737,0.0005218117,0.0000200261,0.00002162518,0.0001760381,0.0002810343,0.02522036,0.002724492,0.9692347,0.001688025,0.00002818428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6674292,0.0005214927,0.3144975,0.0007743277,0.00006701372,0.00009912744,0.0004334064,0.0008634724,0.01531452],"genre_scores_gemma":[0.948377,0.0002801348,0.04164994,0.0002601636,0.0001001775,0.0001725951,0.0004050776,0.0003463498,0.008408654],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006329183,"threshold_uncertainty_score":0.02117324,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04165431843452008,"score_gpt":0.2921332516211976,"score_spread":0.2504789331866776,"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."}}