- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
HOMOGENEOUSLY TRACEABLE AND HAMILTONIAN CONNECTED GRAPHS ; volume:17 ; number:4 ; year:1984 ; pages:1051-1068 ; extent:18
Demonstratio mathematica ; 17, Heft 4 (1984), 1051-1068 (gesamt 18)
- Creator
-
Skupień, Zdzislaw
- DOI
-
10.1515/dema-1984-0424
- URN
-
urn:nbn:de:101:1-2411151545115.205786338186
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:24 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Skupień, Zdzislaw
Other Objects (12)
Maximally connected graphs and digraphs
Sufficient Conditions for Graphs to Be $\textitk}$-Connected, Maximally Connected, and Super-Connected
Hamiltonian properties of products of graphs and digraphs
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
CONNECTED PARTITIONS AND CYCLE MATROIDS OF GRAPHS
Structure and constructions of 3-connected graphs
ON n-HAMILTONIAN GRAPHS OF MINIMAL SIZE
Maximally and super connected multisplit graphs and digraphs
Graph Databases, a little connected tour
Pentagonal geometries with connected deficiency graph
Optimal Graph Coverings with Connected Subgraphs
Strongly Proper Connected Coloring of Graphs
Maximally connected graphs and digraphs
Sufficient Conditions for Graphs to Be $\textitk}$-Connected, Maximally Connected, and Super-Connected
Hamiltonian properties of products of graphs and digraphs
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
CONNECTED PARTITIONS AND CYCLE MATROIDS OF GRAPHS
Structure and constructions of 3-connected graphs
ON n-HAMILTONIAN GRAPHS OF MINIMAL SIZE
Maximally and super connected multisplit graphs and digraphs
Graph Databases, a little connected tour
Pentagonal geometries with connected deficiency graph
Optimal Graph Coverings with Connected Subgraphs
Strongly Proper Connected Coloring of Graphs
Maximally connected graphs and digraphs
Sufficient Conditions for Graphs to Be $\textitk}$-Connected, Maximally Connected, and Super-Connected
Hamiltonian properties of products of graphs and digraphs
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
CONNECTED PARTITIONS AND CYCLE MATROIDS OF GRAPHS
Structure and constructions of 3-connected graphs
ON n-HAMILTONIAN GRAPHS OF MINIMAL SIZE
Maximally and super connected multisplit graphs and digraphs
Graph Databases, a little connected tour
Pentagonal geometries with connected deficiency graph
Optimal Graph Coverings with Connected Subgraphs