{"id":"W2008914847","doi":"10.1016/s0166-218x(99)00163-8","title":"Pancyclicity and NP-completeness in planar graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Completeness (order theory); Combinatorics; NP-complete; Planar; Planar graph; Discrete mathematics; Graph; Time complexity; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.002129421,0.00101712,0.002261951,0.001631543,0.003362751,0.006095609,0.003199153,0.002621609,0.007722596],"category_scores_gemma":[0.01913474,0.001936209,0.002123568,0.004081083,0.00655128,0.01437861,0.004336249,0.008282867,0.0008989169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002211739,"about_ca_system_score_gemma":0.001837947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003322204,"about_ca_topic_score_gemma":0.003303458,"domain_scores_codex":[0.9963899,0.0009428677,0.0002349619,0.0009491872,0.0008450059,0.0006381077],"domain_scores_gemma":[0.9628369,0.02870172,0.002772479,0.002713206,0.001715201,0.001260461],"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.0009749017,0.0003880126,0.004536015,0.001051251,0.0002439875,0.0005701539,0.002137878,0.03169466,0.003501673,0.9107521,0.01633473,0.02781472],"study_design_scores_gemma":[0.00007184711,0.00002645115,0.0006424654,0.0000223441,0.00003889639,0.0002194464,0.0001985958,0.01145081,0.0006219237,0.9847159,0.001973316,0.00001799693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6702852,0.004962166,0.1843728,0.02277186,0.0004307103,0.0002879383,0.005047226,0.0008636931,0.1109783],"genre_scores_gemma":[0.9601173,0.002483887,0.0229313,0.001168613,0.0006860734,0.000270361,0.002958929,0.0001845799,0.00919896],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007722596,"threshold_uncertainty_score":0.02583462,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0183941956439401,"score_gpt":0.2686029003853998,"score_spread":0.2502087047414597,"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."}}