An extremal problem on group connectivity of graphs
- 31 August 2012
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 33 (6) , 1078-1085
Abstract
No abstract availableKeywords
Funding Information
- NSF-China (NSFC-11171228)
- NSF (DMS-0852452)
This publication has 13 references indexed in Scilit:
- Nowhere-zero 3-flows in triangularly connected graphsJournal of Combinatorial Theory, Series B, 2008
- Ore-condition and -connectivityEuropean Journal of Combinatorics, 2008
- On Group Connectivity of GraphsGraphs and Combinatorics, 2008
- Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-FlowsSIAM Journal on Discrete Mathematics, 2008
- Group connectivity of graphs with diameter at most 2European Journal of Combinatorics, 2006
- Nowhere-zero -flows through -connectivityDiscrete Mathematics, 2006
- Group Connectivity of 3-Edge-Connected Chordal GraphsGraphs and Combinatorics, 2000
- Group connectivity of graphs—A nonhomogeneous analogue of nowhere-zero flow propertiesJournal of Combinatorial Theory, Series B, 1992
- Algorithms for constructing graphs and digraphs with given valences and factorsDiscrete Mathematics, 1973
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. IJournal of the Society for Industrial and Applied Mathematics, 1962