The symmetric (2k, k)-graphs
From MaRDI portal
Publication:2708794
DOI<35::AID-JGT4>3.0.CO;2-J 10.1002/1097-0118(200101)36:1<35::AID-JGT4>3.0.CO;2-JzbMath0977.05075MaRDI QIDQ2708794
Publication date: 8 January 2002
Full work available at URL: https://doi.org/10.1002/1097-0118(200101)36:1<35::aid-jgt4>3.0.co;2-j
Cites Work
- On locally \(k\)-critically \(n\)-connected graphs
- Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
- The connectivity of strongly regular graphs
- Generalizaions of critical connectivity of graphs
- On \(k\)-critical connected line graphs
- On critically h-connected simple graphs
- On k-critical, n-connected graphs
- Fragments in 2-critically \(n\)-connected graphs
- On the existence of \((k,l)\)-critical graphs
- The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)
- Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
- Über den Zusammenhang von Graphen, mit Anwendung auf symmetrische Graphen
- Domination-balanced graphs
- Nonseparating cycles inK-Connected graphs
- Die Zusammenhangsstruktur symmetrischer Graphen.
- Maximal matchings in graphs with given minimal and maximal degrees
- An algorithm for the decomposition of graphs into cliques