Group connectivity for K^-k_m, n
From MaRDI portal
Publication:2870951
Recommendations
- Group connectivity of certain graphs
- Group connectivity of graphs with diameter at most 2
- Group connectivity of two kinds of graphs
- A generalization of 0-sum flows in graphs
- Group connectivity under 3‐edge‐connectivity
- Group connectivity and group colorings of graphs --- a survey
- Flow-contractible configurations and group connectivity of signed graphs
- Group connectivity and group coloring: small groups versus large groups
- scientific article; zbMATH DE number 3947966
- A dual version of the brooks group coloring theorem
Cited in
(11)- On group hypo-connected graphs
- Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization
- The sum necessary to ensure that a degree sequence pair has an \(a\)-connected realization
- Nonabelian flows in networks
- Group connectivity of two kinds of graphs
- scientific article; zbMATH DE number 5172365 (Why is no real title available?)
- Bigraphic pairs with an A-connected realization
- Disconnectedness of the subgraph \(F^3\) for the group \({\varGamma}^3\)
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Group connectivity of certain graphs
- Group connectivity of Kneser graphs
This page was built for publication: Group connectivity for \(K^{-k}_{m, n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870951)