Generalized signed graphs of large girth and large chromatic number

DOI10.1016/j.disc.2022.112980zbMath1496.05063OpenAlexW4281567129MaRDI QIDQ2144578

Yangyan Gu, Yeong-Nan Yeh, Hao Qi, Xuding Zhu

Publication date: 14 June 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.112980

zbMATH Keywords

chromatic numbergirthsigned graphaugmenting treegeneralized signed graph

Mathematics Subject Classification ID

Trees (05C05) Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Cites Work

• Coloring, sparseness and girth
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• A small non-\(\mathbb Z_4\)-colorable planar graph
• The chromatic number of a signed graph
• Chromatically optimal rigid graphs
• Signed graph coloring
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• On sparse graphs with given colorings and homomorphisms.
• Colouring of generalized signed triangle-free planar graphs
• Biased graphs. III: Chromatic and dichromatic invariants
• On the 4-color theorem for signed graphs
• Colouring of \(S\)-labelled planar graphs
• A refinement of choosability of graphs
• The chromatic spectrum of signed graphs
• Graph Theory and Probability
• Circular coloring of signed graphs
• On chromatic number of finite set-systems

This page was built for publication: Generalized signed graphs of large girth and large chromatic number