{"id":"W2024156610","doi":"10.1016/j.disc.2008.05.016","title":"On the complexity of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si15.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>H</mml:mi></mml:math>-colouring planar graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Planar graph; Scroll; Graph; Discrete mathematics; Planar; Algorithm; Computer science; Computer graphics (images); Theology","routes":{"ca_aff":true,"ca_fund":false,"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.003065959,0.001335241,0.002227564,0.002724449,0.003297658,0.01116063,0.004429234,0.003320595,0.03016667],"category_scores_gemma":[0.03435083,0.001314646,0.002558313,0.004683207,0.005067775,0.02387104,0.00648273,0.007295467,0.003098448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006494746,"about_ca_system_score_gemma":0.002675085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00678309,"about_ca_topic_score_gemma":0.008064017,"domain_scores_codex":[0.9945056,0.001631201,0.0003589953,0.001081381,0.001637179,0.0007855957],"domain_scores_gemma":[0.9296767,0.06000892,0.00249552,0.003720804,0.002124565,0.001973598],"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.0007349998,0.0002207485,0.005188311,0.0009309833,0.0001956624,0.0003993799,0.001208923,0.04859475,0.002074366,0.8487027,0.04744077,0.04430841],"study_design_scores_gemma":[0.00006705324,0.00003011608,0.001187965,0.00005903639,0.00006584567,0.0002192186,0.0001975062,0.0455013,0.0006996936,0.9471737,0.004761273,0.00003716092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4392492,0.006177448,0.2839231,0.04678773,0.0008963458,0.0005028581,0.01201111,0.001564396,0.2088878],"genre_scores_gemma":[0.8545939,0.004344634,0.08622764,0.002497534,0.001929951,0.000599017,0.009113037,0.001267857,0.03942635],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03016667,"threshold_uncertainty_score":0.1009175,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04096830284349864,"score_gpt":0.2736410474955918,"score_spread":0.2326727446520932,"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."}}