Minimal 2-connected non-hamiltonian claw-free graphs

Jan Brousek

doi:10.1016/s0012-365x(98)00093-4

ScienceGate Book Chapters

JOURNAL ARTICLE

Minimal 2-connected non-hamiltonian claw-free graphs

Jan Brousek

Year: 1998 Journal: Discrete Mathematics Vol: 191 (1-3)Pages: 57-64 Publisher: Elsevier BV

DOI: 10.1016/s0012-365x(98)00093-4

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Combinatorics Induced subgraph Claw Induced subgraph isomorphism problem Discrete mathematics Distance-hereditary graph Hamiltonian (control theory) Property (philosophy) Graph Line graph Graph power Voltage graph

Metrics

Cited By

2.82

FWCI (Field Weighted Citation Impact)

Refs

0.90

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Minimal 2-connected non-hamiltonian claw-free graphs

Metrics

Citation History

Topics

Related Documents

Hamiltonian Connected Claw-Free Graphs

Hamiltonian cycles in 2‐connected claw‐free‐graphs

Hamiltonian N2-locally connected claw-free graphs

Hamiltonian cycles in 3‐connected claw‐free graphs

Hamiltonian cycles in 3-connected Claw-free graphs