Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications

DOI10.1016/j.dam.2023.01.008OpenAlexW4320235400WikidataQ124853183 ScholiaQ124853183MaRDI QIDQ2686135

Rong Luo, Yan Cao, Yue Zhao, Zheng-Ke Miao

Publication date: 24 February 2023

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

Full work available at URL: https://doi.org/10.1016/j.dam.2023.01.008

zbMATH Keywords

edge coloringcritical graphsKempe chainsizing adjacency lemmaVizing fan

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• The chromatic number of a signed graph
• Signed graph coloring
• Edge coloring of signed graphs
• Concepts of signed graph coloring
• Edge coloring signed graphs
• On the Laplacian coefficients of signed graphs
• On the coloring of signed graphs
• A Planar linear arboricity conjecture
• Multicoloring the incidentors of a weighted directed multigraph
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY

This page was built for publication: Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications