{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007439528,0.0004072863,0.0005294963,0.0005481413,0.0003009404,0.0002891049,0.001520711,0.0001559943,0.00008922371],"category_scores_gemma":[0.0000895264,0.0003781661,0.0003461104,0.001416848,0.0001822831,0.0007568853,0.0002514044,0.0003855145,0.00005396713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008629503,"about_ca_system_score_gemma":0.0000597502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006612145,"about_ca_topic_score_gemma":0.00002626791,"domain_scores_codex":[0.9968851,0.0001172324,0.0005683561,0.0008031721,0.0006352768,0.000990842],"domain_scores_gemma":[0.9977635,0.0005733718,0.00023482,0.001165201,0.00009741427,0.0001656527],"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.00005300458,0.0006710282,0.0002192594,0.0003928765,0.0001684647,0.0002374133,0.03415985,0.00005189122,0.002075885,0.9147801,0.001185601,0.04600461],"study_design_scores_gemma":[0.001456171,0.0003088776,0.000127069,0.0002634586,0.00001501049,0.00006318927,0.0006417,0.05515149,0.003196641,0.9349495,0.003269674,0.0005571921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0472972,0.0001550091,0.9466462,0.000335827,0.0002236444,0.00116628,0.00007887888,0.0001639759,0.003932966],"genre_scores_gemma":[0.4120786,0.0001913237,0.5831918,0.0007305586,0.000178079,0.0009228102,0.0000388137,0.0001826702,0.002485343],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3647814,"threshold_uncertainty_score":0.999867,"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."}}