On \(( n , m )\)-chromatic numbers of graphs with bounded sparsity parameters
DOI10.1016/j.dam.2024.07.029zbMATH Open1547.05093MaRDI QIDQ6611087
Abhiruk Lahiri, S. Taruni, Soumen Nandi, Sandip Das, Sagnik Sen
Publication date: 26 September 2024
Published in: (Search for Journal in Brave)
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)
This page was built for publication: On \(( n , m )\)-chromatic numbers of graphs with bounded sparsity parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611087)
