scientific article; zbMATH DE number 4110721
From MaRDI portal
Publication:3834074
Recommendations
Cited in
(9)- Cycles with prescribed and forbidden sets of elements in cubic graphs
- Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
- scientific article; zbMATH DE number 4027507 (Why is no real title available?)
- Circumferences of 2-factors in claw-free graphs
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
- Hamilton‐connected {claw,net}‐free graphs, II
- Hamilton-connected claw-free graphs with Ore-degree conditions
- Hamilton‐connected {claw, bull}‐free graphs
- Hamilton‐connected {claw, net}‐free graphs, I
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3834074)