Group connectivity and group colorings of graphs --- a survey
From MaRDI portal
Publication:2430307
Recommendations
- Group connectivity and group coloring: small groups versus large groups
- A dual version of the brooks group coloring theorem
- scientific article; zbMATH DE number 1472119
- Group connectivity under 3‐edge‐connectivity
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
Cites work
- 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
- A Contribution to the Theory of Chromatic Polynomials
- A note on group colorings
- Additive bases of vector spaces over prime fields
- Advances on the Hamiltonian problem -- a survey
- An equivalent version of the 3-flow conjecture
- An inequality for the chromatic number of a graph
- An inequality for the group chromatic number of a graph
- Claw‐decompositions and tutte‐orientations
- Degree conditions for group connectivity
- Degree sum and nowhere-zero 3-flows
- Double cycle covers and the petersen graph
- Duality in graph families
- Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected
- Extending a partial nowhere-zero 4-flow
- Graph family operations
- Graph theory with applications
- Group chromatic number of graphs without \(K_5\)-minors
- Group chromatic number of planar graphs of girth at least 4
- Group connectivity of 3-edge-connected chordal graphs
- Group connectivity of certain graphs
- Group connectivity of complementary graphs
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Group connectivity of graphs with diameter at most 2
- Group connectivity of Kneser graphs
- Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
- Grötzsch's theorem on 3-colorings
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 434910 (Why is no real title available?)
- scientific article; zbMATH DE number 1472119 (Why is no real title available?)
- scientific article; zbMATH DE number 1534821 (Why is no real title available?)
- scientific article; zbMATH DE number 861308 (Why is no real title available?)
- scientific article; zbMATH DE number 908784 (Why is no real title available?)
- scientific article; zbMATH DE number 2188403 (Why is no real title available?)
- scientific article; zbMATH DE number 3286813 (Why is no real title available?)
- scientific article; zbMATH DE number 3402663 (Why is no real title available?)
- scientific article; zbMATH DE number 4187837 (Why is no real title available?)
- Mod (2p + 1)-Orientations and $K_{1,2p+1}$-Decompositions
- Nowhere zero flows in line graphs
- Nowhere-zero 3-flows in squares of graphs
- Nowhere-zero 3-flows in triangularly connected graphs
- Nowhere-zero 3-flows of highly connected graphs
- Nowhere-zero 6-flows
- Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
- Nowhere‐zero 3‐flows in locally connected graphs
- On a closure concept in claw-free graphs
- On eulerian subgraphs of complementary graphs
- On group chromatic number of graphs
- On group connectivity of graphs
- On mod \((2p+1)\)-orientations of graphs
- On the algebraic theory of graph colorings
- Ore Condition and Nowhere-Zero 3-Flows
- Ore-condition and \(Z_3\)-connectivity
- Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
- Reduced graphs of diameter two
- Supereulerian complementary graphs
Cited in
(42)- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Bigraphic pairs with an A-connected realization
- Flow-contractible configurations and group connectivity of signed graphs
- A note on Z₃-connected graphs with degree sum condition
- The Chvátal-Erdős condition for group connectivity in graphs
- Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions
- Weighted modulo orientations of graphs and signed graphs
- Eulerian subgraphs and \(S\)-connectivity of graphs
- 4-colouring of generalized signed planar graphs
- Colouring of \(S\)-labelled planar graphs
- Group connectivity and group coloring: small groups versus large groups
- Group connectivity and matchings
- \(Z_3\)-connectivity of claw-free graphs
- Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization
- Neighborhood unions and \(Z_3\)-connectivity in graphs
- Spanning triangle-trees and flows of graphs
- An extremal problem on bigraphic pairs with an \(A\)-connected realization
- Group-colouring, group-connectivity, claw-decompositions, and orientations in 5-edge-connected planar graphs
- Group connectivity for \(K^{-k}_{m, n}\)
- Disproof of the group coloring version of the Hadwiger conjecture
- Degree sum of a pair of independent edges and \(Z_{3}\)-connectivity
- Degree sum of 3 independent vertices and \(Z_3\)-connectivity
- \(Z_3\)-connectivity in abelian Cayley graphs
- Realizing degree sequences as \(Z_3\)-connected graphs
- A note on an extremal problem for group-connectivity
- Degree condition and \(Z_3\)-connectivity
- Nowhere-zero 3-flows and \(Z_3\)-connectivity in bipartite graphs
- A dual version of the brooks group coloring theorem
- 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
- Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
- Nonabelian flows in networks
- Group connectivity under 3‐edge‐connectivity
- Group coloring and group connectivity with non-isomorphic groups of the same order
- On the strict Chvátal-condition and nowhere-zero 3-flows
- Polynomials counting group colorings in graphs
- On graphs whose \(\mathbb{Z}_4\)-connectivity varies from \(\mathbb{Z}_2^2\)-connectivity
- On the number of edges of a simple Z₂ Z₂-connected graph
- Maximum degree condition and group connectivity
- \(Z_3\)-connectivity of wreath product of graphs
This page was built for publication: Group connectivity and group colorings of graphs --- a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2430307)
