A note on Hadwiger’s conjecture for path-chromatic number

Let G be a graph and (T, B) be a tree-decomposition of G, where B = (Bt) tV (T ) .The chromatic number of (T, B) is the maximum chromatic number among the subgraphs induced by Bt.The tree-chromatic number of G is the minimum chromatic number of the tree-decompositions of G.

Publication Details

Journal
Discrete Mathematics Letters
Published
2025-05-06
DOI
https://doi.org/10.47443/dml.2024.186
Citations
1
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
1.50

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A note on Hadwiger’s conjecture for path-chromatic number

1 citations
Discrete Mathematics Letters
Graph Labeling and Dimension Problems
1.50
article

A note on Hadwiger’s conjecture for path-chromatic number

article en
1 citations

Abstract

Let G be a graph and (T, B) be a tree-decomposition of G, where B = (Bt) tV (T ) .The chromatic number of (T, B) is the maximum chromatic number among the subgraphs induced by Bt.The tree-chromatic number of G is the minimum chromatic number of the tree-decompositions of G.

Discrete Mathematics LettersVol. 15
Exploratory Research for Advanced Technology
Openalex Percentile: Top 17%
Graph Labeling and Dimension Problems
1.50
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A note on Hadwiger’s conjecture for path-chromatic number · Discrete Mathematics Letters (2025) | TGRS Research Map | TGRS