- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
CONNECTED PARTITIONS AND CYCLE MATROIDS OF GRAPHS ; volume:24 ; number:1-2 ; year:1991 ; pages:183-190 ; extent:8
Demonstratio mathematica ; 24, Heft 1-2 (1991), 183-190 (gesamt 8)
- Urheber
-
Majcher, Zofia
Plonka, Jerzy
- DOI
-
10.1515/dema-1991-1-218
- URN
-
urn:nbn:de:101:1-2411151703311.088218978331
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:26 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Majcher, Zofia
- Plonka, Jerzy
Ähnliche Objekte (12)
GRAPHS OF PARTIAL PARTITIONS
Edge partitions in undirected graphs
Flips & Partitions in Geometric Graphs
Pseudoforest Partitions and the Approximation of Connected Subgraphs of High Density
Representing Graphs as Bag of Vertices and Partitions for Graph Classification
Maximally connected graphs and digraphs
A theory of spectral partitions of metric graphs
Blind Extraction of Equitable Partitions from Graph Signals
Sufficient Conditions for Graphs to Be $\textitk}$-Connected, Maximally Connected, and Super-Connected
Asymptotics and Estimates for Spectral Minimal Partitions of Metric Graphs
HOMOGENEOUSLY TRACEABLE AND HAMILTONIAN CONNECTED GRAPHS
Complexitiy and partitions
GRAPHS OF PARTIAL PARTITIONS
Edge partitions in undirected graphs
Flips & Partitions in Geometric Graphs
Pseudoforest Partitions and the Approximation of Connected Subgraphs of High Density
Representing Graphs as Bag of Vertices and Partitions for Graph Classification
Maximally connected graphs and digraphs
A theory of spectral partitions of metric graphs
Blind Extraction of Equitable Partitions from Graph Signals
Sufficient Conditions for Graphs to Be $\textitk}$-Connected, Maximally Connected, and Super-Connected
Asymptotics and Estimates for Spectral Minimal Partitions of Metric Graphs
HOMOGENEOUSLY TRACEABLE AND HAMILTONIAN CONNECTED GRAPHS
Complexitiy and partitions
GRAPHS OF PARTIAL PARTITIONS
Edge partitions in undirected graphs
Flips & Partitions in Geometric Graphs
Pseudoforest Partitions and the Approximation of Connected Subgraphs of High Density
Representing Graphs as Bag of Vertices and Partitions for Graph Classification
Maximally connected graphs and digraphs
A theory of spectral partitions of metric graphs
Blind Extraction of Equitable Partitions from Graph Signals
Sufficient Conditions for Graphs to Be $\textitk}$-Connected, Maximally Connected, and Super-Connected
Asymptotics and Estimates for Spectral Minimal Partitions of Metric Graphs
HOMOGENEOUSLY TRACEABLE AND HAMILTONIAN CONNECTED GRAPHS