Group connectivity and group colorings of graphs --- a survey
From MaRDI portal
Publication:2430307
DOI10.1007/s10114-010-9746-3zbMath1233.05127OpenAlexW2079944966MaRDI QIDQ2430307
Xiangwen Li, Mingquan Zhan, Hong-Jian Lai, Yehong Shao
Publication date: 6 April 2011
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-010-9746-3
Related Items (32)
\(Z_3\)-connectivity of claw-free graphs ⋮ An extremal problem on bigraphic pairs with an \(A\)-connected realization ⋮ Neighborhood unions and \(Z_3\)-connectivity in graphs ⋮ Degree sum of a pair of independent edges and \(Z_{3}\)-connectivity ⋮ Disproof of the group coloring version of the Hadwiger conjecture ⋮ Spanning triangle-trees and flows of graphs ⋮ Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization ⋮ Degree sum of 3 independent vertices and \(Z_3\)-connectivity ⋮ A note on \(Z_3\)-connected graphs with degree sum condition ⋮ \(Z_3\)-connectivity in abelian Cayley graphs ⋮ Eulerian subgraphs and \(S\)-connectivity of graphs ⋮ Realizing degree sequences as \(Z_3\)-connected graphs ⋮ Group connectivity under 3‐edge‐connectivity ⋮ A note on an extremal problem for group-connectivity ⋮ Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees ⋮ \(Z_3\)-connectivity of wreath product of graphs ⋮ \(4\)-colouring of generalized signed planar graphs ⋮ Degree condition and \(Z_3\)-connectivity ⋮ Bigraphic pairs with an \(A\)-connected realization ⋮ Nowhere-zero 3-flows and \(Z_3\)-connectivity in bipartite graphs ⋮ A dual version of the brooks group coloring theorem ⋮ Colouring of \(S\)-labelled planar graphs ⋮ Graphic sequences with an \(A\)-connected realization ⋮ Group chromatic number of Halin graphs ⋮ A complete characterization of graphic sequences with a \(Z_3\)-connected realization ⋮ A Note on Group Colorings and Group Structure ⋮ The Chvátal-Erdős condition for group connectivity in graphs ⋮ Flow-contractible configurations and group connectivity of signed graphs ⋮ Maximum degree condition and group connectivity ⋮ Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions ⋮ Weighted modulo orientations of graphs and signed graphs ⋮ Group connectivity and matchings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
- Group connectivity of graphs with diameter at most 2
- Ore-condition and \(Z_3\)-connectivity
- Nowhere-zero 3-flows in triangularly connected graphs
- Degree conditions for group connectivity
- Degree sum and nowhere-zero 3-flows
- Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected
- On mod \((2p+1)\)-orientations of graphs
- On group connectivity of graphs
- Nowhere-zero 6-flows
- Additive bases of vector spaces over prime fields
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Duality in graph families
- Nowhere-zero 3-flows of highly connected graphs
- Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
- Group chromatic number of graphs without \(K_5\)-minors
- On a closure concept in claw-free graphs
- Advances on the Hamiltonian problem -- a survey
- Group connectivity of 3-edge-connected chordal graphs
- An equivalent version of the 3-flow conjecture
- Nowhere-zero 3-flows in squares of graphs
- An inequality for the group chromatic number of a graph
- On group chromatic number of graphs
- Grötzsch's theorem on 3-colorings
- Group connectivity of complementary graphs
- Double cycle covers and the petersen graph
- Reduced graphs of diameter two
- Group connectivity of Kneser graphs
- Mod (2p + 1)-Orientations and $K_{1,2p+1}$-Decompositions
- Ore Condition and Nowhere-Zero 3-Flows
- Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
- 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
- On eulerian subgraphs of complementary graphs
- Extending a partial nowhere-zero 4-flow
- Supereulerian complementary graphs
- Nowhere‐zero 3‐flows in locally connected graphs
- Claw‐decompositions and tutte‐orientations
- Group chromatic number of planar graphs of girth at least 4
- On the algebraic theory of graph colorings
- An inequality for the chromatic number of a graph
- A note on group colorings
- A Contribution to the Theory of Chromatic Polynomials
- Graph family operations
- Nowhere zero flows in line graphs
This page was built for publication: Group connectivity and group colorings of graphs --- a survey
