{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001027683,0.0003756993,0.0003400632,0.0001725038,0.0007644544,0.0001824415,0.001925415,0.0002280858,0.00002866327],"category_scores_gemma":[0.000524711,0.0003346223,0.0004545688,0.0005982274,0.00112969,0.0004402951,0.0007884646,0.0006137582,0.0003298529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001891895,"about_ca_system_score_gemma":0.0001586884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004284533,"about_ca_topic_score_gemma":0.00002953674,"domain_scores_codex":[0.996537,0.0001458669,0.0007268075,0.0005882334,0.001237123,0.0007649275],"domain_scores_gemma":[0.9961376,0.001196281,0.0005778791,0.001777027,0.00009228757,0.0002188952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008012958,0.0001811008,0.00001398329,0.0002597307,0.0001410469,0.00012959,0.002600834,0.0004696116,0.000716914,0.9950161,0.0002647493,0.0001261909],"study_design_scores_gemma":[0.0004234503,0.0003426493,0.00009070215,0.0003050071,0.00004392442,0.000182689,0.000446106,0.8208864,0.008237867,0.1685405,0.0001698811,0.0003308285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9661823,0.00009004099,0.02954512,0.0004455964,0.0002274831,0.0001467392,0.00007525749,0.0001582743,0.003129202],"genre_scores_gemma":[0.9713001,0.00009257683,0.02791099,0.0002939473,0.00008670229,0.0001137093,0.00003201181,0.00008548403,0.00008442444],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8264756,"threshold_uncertainty_score":0.9999106,"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."}}