Cover Image

Total b-chromatic Colouring of Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Granada, Fabricio Mendoza, Manlove, David
Format:	Preprint
Published:	2025
Subjects:	Combinatorics F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

New Results on Edge-coloring and Total-coloring of Split Graphs
by: Couto, Fernanda, et al.
Published: (2023)

The characteristic polynomials of $r$-uniform hypercycles with length $l$
by: Bo, Dong, et al.
Published: (2025)

Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs
by: Büngener, Aaron, et al.
Published: (2024)

On the star b-chromatic number of a graph
by: Božović, Dragana, et al.
Published: (2025)

Conflict-Free Colouring of Subsets
by: Jartoux, Bruno, et al.
Published: (2022)

On rainbow domination of cubic graphs
by: Žerovnik, Janez
Published: (2024)

Circularity and Symmetries of $p$ and $p^{2}$-polygons
by: Haag, Rolf
Published: (2025)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
by: MacRury, Calum, et al.
Published: (2022)

On the Min-Max Star Partitioning Number
by: Feldmann, Sarah, et al.
Published: (2024)

A note on locating-dominating sets in twin-free graphs
by: Bousquet, Nicolas, et al.
Published: (2024)

On the Uncrossed Number of Graphs
by: Balko, Martin, et al.
Published: (2024)

A Variant of Game of Sliding Coins
by: Miyadera, Ryohei, et al.
Published: (2025)

On Minimum Maximal Distance-k Matchings
by: Kartynnik, Yury, et al.
Published: (2016)

Algorithmic Applications of Tyshkevich's Graph Decomposition: A Primer and a Toolkit
by: Cheng, Christine T., et al.
Published: (2026)

Ortho-unit polygons can be guarded with at most $\lfloor \frac{n-4}{8} \rfloor$ guards
by: Díaz-Báñez, J. M., et al.
Published: (2022)

Extremal chromatic bounds for distance Laplacian eigenvalues
by: Rather, Bilal Ahmad
Published: (2026)

Independent Set Enumeration and Estimation of Related Constants of Grid Graphs and Their Variants
by: Liang, Kai
Published: (2025)

Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry
by: Mukherjee, Sayan, et al.
Published: (2025)

On λ-backbone coloring of cliques with tree backbones in linear time
by: Michalik, Krzysztof, et al.
Published: (2021)

Online Bipartite Matching in the Probe-Commit Model
by: Borodin, Allan, et al.
Published: (2023)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
by: Ma, Will, et al.
Published: (2024)

Separating Matchings in Cubic Graphs
by: Gutiérrez, Juan, et al.
Published: (2026)

Block-weighted random graphs: planar and beyond
by: Kang, Mihyun, et al.
Published: (2026)

Asymptotic Transfer in Critical Recursive Composition Schemes
by: Drmota, Michael, et al.
Published: (2026)

Almost regular subgraphs under spectral radius constrains
by: Xu, Weilun, et al.
Published: (2024)

Flipping odd matchings in geometric and combinatorial settings
by: Aichholzer, Oswin, et al.
Published: (2025)

On a particular specialization of monomial symmetric functions
by: Brugidou, Vincent
Published: (2023)

From flip processes to dynamical systems on graphons
by: Garbe, Frederik, et al.
Published: (2022)

Compact Representation of Semilinear and Terrain-like Graphs
by: Cardinal, Jean, et al.
Published: (2025)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
by: de Rezende, Susanna F., et al.
Published: (2019)

Independent Set Enumeration in King Graphs by Tensor Network Contractions
by: Liang, Kai
Published: (2025)

Interval Graphs are Reconstructible
by: Heinrich, Irene, et al.
Published: (2025)

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
by: Conneryd, Jonas, et al.
Published: (2025)

On Total Bondage Number of Graphs
by: Gamlath, E. G. K. M., et al.
Published: (2024)

General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
by: Charvy, Gaspard, et al.
Published: (2025)

Minimizing an Uncrossed Collection of Drawings
by: Hliněný, Petr, et al.
Published: (2023)

Closed form logical error rate approximations for surface codes
by: Regev, Shaked, et al.
Published: (2026)

An analogue of Bonami's Lemma for functions on spaces of linear maps, and 2-2 Games
by: Ellis, David, et al.
Published: (2022)

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
by: Masařík, Tomáš, et al.
Published: (2026)

Computing parameters that generalize interval graphs using restricted modular partitions
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)