{"id":"W2403587392","doi":"","title":"On (k, t)-choosability of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; List coloring; Mathematics; Vertex (graph theory); Graph; Fractional coloring; Graph coloring; Complete coloring; Planar graph; Brooks' theorem; Edge coloring; Discrete mathematics; Chordal graph; 1-planar graph; Graph power; Line graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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.00159291,0.002237364,0.001353836,0.002266878,0.002492708,0.002673168,0.001907692,0.002847752,0.01289893],"category_scores_gemma":[0.008154301,0.001220978,0.002468664,0.005130304,0.005949921,0.01087472,0.003758606,0.004754512,0.001983834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00287969,"about_ca_system_score_gemma":0.00106715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002301312,"about_ca_topic_score_gemma":0.001506186,"domain_scores_codex":[0.9973478,0.0005614293,0.0002099086,0.0009954316,0.0004207549,0.0004645113],"domain_scores_gemma":[0.9919436,0.00530324,0.0009843917,0.0009308925,0.0003460881,0.0004917733],"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.0006885267,0.0001962426,0.002677691,0.0006154639,0.0001138345,0.0008460382,0.001075267,0.04626296,0.007073259,0.8646993,0.008806046,0.06694528],"study_design_scores_gemma":[0.00009058122,0.0002472361,0.00108963,0.00006947514,0.00004305126,0.0006893929,0.0001322526,0.03504775,0.00167892,0.9523163,0.008531487,0.00006385882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2389702,0.005381585,0.652842,0.003643943,0.0008453889,0.0006556108,0.003094735,0.001115661,0.09345093],"genre_scores_gemma":[0.7607965,0.01031226,0.1818964,0.002723661,0.003279567,0.00168026,0.004491028,0.0008936362,0.03392665],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01289893,"threshold_uncertainty_score":0.0431512,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03021171901577695,"score_gpt":0.2773091559090248,"score_spread":0.2470974368932478,"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."}}