Revisit the coloring problem of Gallai graphs

DOI10.1007/S40305-023-00510-3MaRDI QIDQ6881280zbMATH OpenFDO

Authors Qiu-Lan Zhao, Jinjiang Yuan

Publication date 17 December 2025

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40305-023-00510-3

zbMATH Keywords

chordal graphsGallai coloringGallai graphsstrong proper connection number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• A description of claw-free perfect graphs
• Characterizations of graphs having large proper connection numbers
• Forests and trees among Gallai graphs
• Gallai and anti-Gallai graph operators
• Gallai and anti-Gallai graphs of a graph
• Gallai graphs and anti-Gallai graphs
• Graph theory
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Mortality of iterated Gallai graphs
• On proper-path colorings in graphs
• On rainbow connection
• On rigid circuit graphs
• On strong proper connection number of cubic graphs
• On the hardness of recognizing triangular line graphs
• Proper connection number and connected dominating sets
• Proper connection of graphs
• Rainbow connection in graphs
• Recognizing claw-free perfect graphs
• Some simplified NP-complete graph problems
• Transitiv orientierbare Graphen
• Two classes of perfect graphs
• Upper bounds of proper connection number of graphs

This page was built for publication: Revisit the coloring problem of Gallai graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6881280)