Gap one bounds for the equitable chromatic number of block graphs

DOI10.1016/J.DAM.2023.09.032zbMATH Open1541.05057MaRDI QIDQ6558671

Janusz Dybizbański, Hanna Furmańczyk, Vahan V. Mkrtchyan

Publication date: 20 June 2024

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

zbMATH Keywords

chromatic spectrumequitable coloringEFL conjecturelinear hypertreeblock-graphsymmetric-like block graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Restrictions of graph partition problems. I
• Edge-coloring of 3-uniform hypergraphs
• Equitable colorings of bounded treewidth graphs
• A note on equitable colorings of forests
• Linear hypertree for multi-dimensional image representation
• On edge-colorings of graphs.
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Topics in Intersection Graph Theory
• A Simple Proof of the Gale-Ryser Theorem
• Multicoloring the incidentors of a weighted directed multigraph

This page was built for publication: Gap one bounds for the equitable chromatic number of block graphs

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