Cover Image

Extending graph total colorings to cell complexes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Dejter, Italo J.
Format:	Preprint
Published:	2026
Subjects:	Combinatorics 05C15, 57M15, 05C62, 05C90, 05C63, 05C90
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Total coloring and efficient domination applications to non-Cayley non-Schreier vertex-transitive graphs
by: Dejter, Italo J.
Published: (2020)

Tight factorizations of girth-$g$-regular graphs
by: Dejter, Italo J.
Published: (2021)

From semi-total to equitable total colorings
by: Dejter, I. J.
Published: (2025)

Reinterpreting the Middle-Levels Theorem via Natural Enumeration of Ordered Trees
by: Dejter, Italo J.
Published: (2019)

IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters
by: Cameron, Thomas R., et al.
Published: (2025)

Properties of leveled spatial graphs
by: Barthel, Senja, et al.
Published: (2024)

Total coloring of regular graphs of girth = degree + 1
by: Dejter, Italo J.
Published: (2024)

Efficient total colorings of cubic maps of girth 4 and related topics
by: Dejter, Italo J
Published: (2026)

The Undirected Optical Indices of Trees
by: Lo, Yuan-Hsun, et al.
Published: (2018)

Castling tree of tight Dyck nests with applications to odd and middle-levels graphs
by: Dejter, Italo J.
Published: (2023)

Coloring, list coloring, and fractional coloring in intersections of matroids
by: Aharoni, Ron, et al.
Published: (2024)

Trivial coloring of Cartesian product of graphs
by: Csernák, Tamás
Published: (2023)

On the number of minimal forts of a graph
by: Becker, Paul, et al.
Published: (2024)

Labeled Chip-Firing on Undirected $k$-ary Trees
by: Inagaki, Ryota, et al.
Published: (2025)

Canonical graph decompositions via coverings
by: Diestel, Reinhard, et al.
Published: (2022)

Canonical graph decompositions via local separations
by: Jacobs, Raphael W., et al.
Published: (2025)

Universal updates of Dyck-nest signatures
by: Dejter, Italo J.
Published: (2022)

Permutation-based Strategies for Labeled Chip-Firing on $k$-ary Trees
by: Inagaki, Ryota, et al.
Published: (2025)

Chip Firing on Directed $k$-ary Trees
by: Inagaki, Ryota, et al.
Published: (2024)

Metric properties of electrical networks and the graph reconstruction problems
by: Gorbounov, V. G., et al.
Published: (2026)

Constructing embedded surfaces for cellular embeddings of leveled spatial graphs
by: Barthel, Senja, et al.
Published: (2024)

On Chip-Firing on Undirected Binary Trees
by: Inagaki, Ryota, et al.
Published: (2024)

Sharing tea on a graph
by: Gollin, J. Pascal, et al.
Published: (2024)

Crossing number of graphs and $\mathsf{ΔY}$-move
by: Huh, Youngsik, et al.
Published: (2024)

Abstract questionnaires and FS-decision digraphs
by: Chen, Jiaye, et al.
Published: (2025)

Zero Forcing on Iterated Graph Models
by: Brice, Christopher, et al.
Published: (2025)

Distinguishing regular graphs from lists
by: Kwaśny, Jakub, et al.
Published: (2022)

On a problem concerning integer distance graphs
by: Oravcová, Janka, et al.
Published: (2024)

A numeral system for the middle-levels graphs
by: Dejter, Italo J.
Published: (2010)

The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
by: Caro, Yair, et al.
Published: (2025)

Thinness and its variations on some graph families and coloring graphs of bounded thinness
by: Bonomo-Braberman, Flavia, et al.
Published: (2023)

On the hat guessing number of a planar graph class
by: Bradshaw, Peter
Published: (2021)

On the forts and related parameters of the hypercube graph
by: Brimkov, Boris, et al.
Published: (2025)

Partial Petrial polynomials for complete graphs and paths
by: Yan, Qi, et al.
Published: (2025)

Throttling for standard zero forcing on directed graphs
by: Cairncross, Emily, et al.
Published: (2020)

Characterizing circle graphs with binomial partial Petrial polynomials
by: Feng, Ruiqing, et al.
Published: (2025)

A Simple Construction of Tournaments with Finite and Uncountable Dichromatic Number
by: Sadhukhan, Arpan
Published: (2024)

On Proper Colorings of Functions
by: Csernák, Tamás
Published: (2022)

Efficient spectral bounds on the chromatic number of Hamming, Johnson, and Kneser graph powers
by: Steinke, Finn A., et al.
Published: (2026)

On the minimal forts of trees
by: Cameron, Thomas R., et al.
Published: (2025)