{"id":"W1695953772","doi":"10.1016/j.ejc.2015.06.005","title":"Improved complexity results on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-coloring <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si5.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math>-free graphs","year":2015,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph coloring; Vertex (graph theory); Complete coloring; Graph; Induced subgraph; Discrete mathematics; Line graph","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.002026599,0.002447865,0.001615229,0.004028005,0.002402029,0.004852225,0.00455607,0.001969866,0.05757092],"category_scores_gemma":[0.01369256,0.0007714138,0.003084515,0.004540087,0.002357922,0.01086248,0.004766167,0.007560912,0.01412159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005582985,"about_ca_system_score_gemma":0.002795662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009384505,"about_ca_topic_score_gemma":0.02020611,"domain_scores_codex":[0.9964964,0.0006671802,0.0001736976,0.0006601111,0.001312131,0.000690447],"domain_scores_gemma":[0.9827544,0.01002923,0.0007648499,0.003498822,0.002040931,0.0009116966],"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.001225003,0.0007128338,0.004662303,0.002505297,0.0003402681,0.0007763068,0.001018732,0.07673921,0.01203457,0.5304832,0.2260728,0.1434295],"study_design_scores_gemma":[0.0001728287,0.0001174152,0.003096717,0.0001660064,0.0002753166,0.0005643134,0.0002444878,0.08571781,0.005593181,0.8559584,0.04797719,0.0001163101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.09669913,0.007378155,0.3725759,0.02007934,0.002575384,0.0005557279,0.01249998,0.005181498,0.4824548],"genre_scores_gemma":[0.6015212,0.0061411,0.2155117,0.004312366,0.003596875,0.0009127773,0.01875661,0.00539052,0.1438569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05757092,"threshold_uncertainty_score":0.1925939,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03197586937708036,"score_gpt":0.2621459650223334,"score_spread":0.230170095645253,"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."}}