Pages that link to "Item:Q1297726"
From MaRDI portal
The following pages link to A bound on the total chromatic number (Q1297726):
Displaying 42 items.
- The adjacent vertex distinguishing total chromatic number (Q442409) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Fractional total colourings of graphs of high girth (Q651031) (← links)
- An upper bound for total colouring of graphs (Q686500) (← links)
- \([r,s,t]\)-colorings of graphs (Q864161) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- A strengthening of Brooks' theorem (Q1306303) (← links)
- Extending fixed vertex-colourings to total colourings (Q1377889) (← links)
- Hadwiger's conjecture for squares of 2-trees (Q1633613) (← links)
- Some bounds on the generalised total chromatic number of degenerate graphs (Q1675922) (← links)
- A note on asymptotically optimal neighbour sum distinguishing colourings (Q1715623) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← links)
- A new upper bound for total colourings of graphs (Q1842182) (← links)
- On bounding the chromatic number of L-graphs (Q1918550) (← links)
- Inclusion total chromatic number (Q2037565) (← links)
- On the coequal values of total chromatic number and chromatic index (Q2101175) (← links)
- Total-coloring of sparse graphs with maximum degree 6 (Q2240657) (← links)
- On total colourings of graphs (Q2277476) (← links)
- On the total neighbour sum distinguishing index of graphs with bounded maximum average degree (Q2292151) (← links)
- Acyclic coloring of graphs and entropy compression method (Q2297725) (← links)
- Total Thue colourings of graphs (Q2340970) (← links)
- \((\mathcal{P},\mathcal{Q})\)-total \((r,s)\)-colorings of graphs (Q2346335) (← links)
- Asymptotically optimal neighbor sum distinguishing total colorings of graphs (Q2374159) (← links)
- \((2,1)\)-total labelling of outerplanar graphs (Q2462398) (← links)
- \((p,1)\)-total labelling of graphs (Q2467731) (← links)
- Semi-total graph colourings, the beta parameter, and total chromatic number (Q2470466) (← links)
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs (Q2514004) (← links)
- Distant set distinguishing total colourings of graphs (Q2629496) (← links)
- List edge-coloring and total coloring in graphs of low treewidth (Q2800543) (← links)
- A survey of graph coloring - its types, methods and applications (Q2978431) (← links)
- Total chromatic number of planar graphs with maximum degree ten (Q3422127) (← links)
- An upper bound for the total chromatic number of dense graphs (Q4013421) (← links)
- Total Coloring With $\Delta + \mbox\lowercasepoly(\log \Delta)$ Colors (Q4229408) (← links)
- On graphs with linear Ramsey numbers (Q4521487) (← links)
- Concentration of non‐Lipschitz functions and applications (Q4537624) (← links)
- (Q4559881) (← links)
- A Stronger Bound for the Strong Chromatic Index (Q4601050) (← links)
- 2-distance vertex-distinguishing total coloring of graphs (Q4634521) (← links)
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz (Q5962524) (← links)
- Efficiently list‐edge coloring multigraphs asymptotically optimally (Q6052475) (← links)
- Total coloring of some graph operations (Q6547840) (← links)
- On the chromatic number of powers of subdivisions of graphs (Q6648291) (← links)
