Group connectivity for K^-k_m, n

zbMATH Open1305.05117MaRDI QIDQ2870951FDOQ2870951

Authors: Jian-Hua Yin, Yue Zhang 

Publication date: 21 January 2014

Published in: Utilitas Mathematica (Search for Journal in Brave)

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

zbMATH Keywords

group connectivitynowhere-zero flow\(A\)-connected graph

Mathematics Subject Classification ID

Flows in graphs (05C21) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Cited In (11)

• Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization
• Nonabelian flows in networks
• The sum necessary to ensure that a degree sequence pair has an \(a\)-connected realization
• Group connectivity of two kinds of graphs
• Title not available (Why is that?)
• 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
• On group hypo-connected 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)