{"id":"W2037002007","doi":"10.1016/s0012-365x(00)00260-0","title":"Thomason's algorithm for finding a second hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Cubic graph; Corollary; Combinatorics; Discrete mathematics; Planar graph; Exponential function; Constructive; Hamiltonian path; Algorithm; Hamiltonian (control theory); Graph; Line graph; Voltage graph; Mathematical analysis; Computer science","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.0006457142,0.001381484,0.001108437,0.0015594,0.002023841,0.002602706,0.003909349,0.001782882,0.02854017],"category_scores_gemma":[0.003048271,0.0009810228,0.002063936,0.002813112,0.001618389,0.005450547,0.002893963,0.002875702,0.004202711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003778316,"about_ca_system_score_gemma":0.004688286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01104092,"about_ca_topic_score_gemma":0.03369493,"domain_scores_codex":[0.9989919,0.0001044017,0.00005576731,0.0002590244,0.0003527616,0.0002361854],"domain_scores_gemma":[0.9980533,0.000797856,0.00008972183,0.0006981699,0.000226071,0.000134931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00129809,0.000487085,0.001683281,0.0007371902,0.0001918708,0.00029462,0.0007658119,0.05893021,0.0223332,0.3034943,0.04467757,0.5651067],"study_design_scores_gemma":[0.0005503261,0.0002894536,0.001617495,0.00008241869,0.0003746929,0.0004675864,0.0006226666,0.5037851,0.03690511,0.4097777,0.04539996,0.0001275814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1244556,0.0005797027,0.7531298,0.003396441,0.0004598399,0.0008935865,0.001501065,0.009826693,0.1057572],"genre_scores_gemma":[0.3714136,0.0004254245,0.5602246,0.0006800366,0.0001382973,0.0005027939,0.002388518,0.002000988,0.06222568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02854017,"threshold_uncertainty_score":0.09547639,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04762917201134028,"score_gpt":0.3176212309829411,"score_spread":0.2699920589716008,"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."}}