Generalizations of the classics to spanning connectedness
From MaRDI portal
Publication:2242808
Recommendations
Cites work
- A method in graph theory
- A note on Hamiltonian circuits
- Graph theory
- scientific article; zbMATH DE number 3349867 (Why is no real title available?)
- scientific article; zbMATH DE number 3186566 (Why is no real title available?)
- Note on Hamilton Circuits
- On 3^*-connected graphs
- On Hamilton's ideals
- On spanning connected graphs
- On spanning disjoint paths in line graphs
- On the extremal number of edges in Hamiltonian connected graphs
- On the extremal number of edges in Hamiltonian graphs
- On the spanning connectivity of tournaments
- Some Theorems on Abstract Graphs
- Spanning connectedness and Hamiltonian thickness of graphs and interval graphs
- Sufficient conditions for graphs to be spanning connected
- Variations on the Hamiltonian Theme
Cited in
(6)- Sufficient conditions for graphs to be spanning connected
- On spanning connected graphs
- Spanning connectedness and Hamiltonian thickness of graphs and interval graphs
- On the spanning connectivity of graphs -- a survey
- On spanning laceability of bipartite graphs
- On sufficient degree conditions for a graph to be disjoint path coverable
This page was built for publication: Generalizations of the classics to spanning connectedness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2242808)