Cover Image

Adjacent vertex distinguishing total coloring of 3-degenerate graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Behera, Diptimaya, Francis, Mathew C., Pallathumadam, Sreejith K.
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Combinatorics 05C15, 68R10 G.2.1; G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the spectra of prefix-reversal graphs
by: Blanco, Saúl A., et al.
Published: (2025)

Some integer values in the spectra of burnt pancake graphs
by: Blanco, Saúl A., et al.
Published: (2024)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
by: Gabryelski, Wojciech, et al.
Published: (2026)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
by: Cavallaro, Dario, et al.
Published: (2026)

Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024)

Searching by Heterogeneous Agents
by: Dereniowski, Dariusz, et al.
Published: (2021)

Homomorphism Counts to Trees
by: Dawar, Anuj
Published: (2024)

Fast winning strategies for the attacker in eternal domination
by: Bagan, Guillaume, et al.
Published: (2024)

Bounds on the Twin-Width of Product Graphs
by: Pettersson, William, et al.
Published: (2022)

A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
by: Asiri, Zayed, et al.
Published: (2024)

Skip Letters for Short Supersequence of All Permutations
by: Tan, Oliver
Published: (2022)

Golden Ratio Growth and Phase Transitions in Chromatic Counts of Circular Chord Graphs
by: Lopez-Bonilla, Rogelio N., et al.
Published: (2025)

Bell Numbers and Stirling Numbers of the Mycielskian of Trees
by: Allagan, J., et al.
Published: (2025)

A coarse Menger's Theorem for planar and bounded genus graphs
by: Blažej, Václav, et al.
Published: (2026)

Killing a Vortex
by: Thilikos, Dimitrios M., et al.
Published: (2022)

WELLDOC property for words generated by morphisms
by: Puzynina, Svetlana, et al.
Published: (2026)

Counting Kernels in Directed Graphs with Arbitrary Orientations
by: Jartoux, Bruno
Published: (2022)

The Hierarchy of Saturating Matching Numbers
by: Simon, Hans U., et al.
Published: (2025)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
by: Choi, Mujin, et al.
Published: (2025)

On the Alon-Tarsi Number of Some Line and Total graphs
by: Prajnanaswaroopa, S.
Published: (2023)

Completely independent spanning trees in the hypercube
by: Shaw, Benedict Randall
Published: (2024)

A framework for distributed discrete evacuation strategies
by: Borowiecki, Piotr, et al.
Published: (2025)

Quickly excluding an annotated planar graph
by: Gorsky, Maximilian, et al.
Published: (2026)

Variants of the Gyàrfàs-Sumner Conjecture: Oriented Trees and Rainbow Paths
by: Basavaraju, Manu, et al.
Published: (2021)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
by: Rockel-Wolff, Benjamin
Published: (2024)

Three iterations of $(d-1)$-WL test distinguish non isometric clouds of $d$-dimensional points
by: Rose, Valentino Delle, et al.
Published: (2023)

Exploration of $k$-edge-deficient temporal graphs in linear time
by: Lahtin, Ivan, et al.
Published: (2026)

Breaking the Symmetries of Amenable Graphs
by: Cheng, Christine T.
Published: (2025)

Bounds and Hardness Results for Conflict-free Choosability
by: Gupta, Shiwali, et al.
Published: (2024)

Polynomial Bounds for the Graph Minor Structure Theorem
by: Gorsky, Maximilian, et al.
Published: (2025)

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

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

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

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
by: Chimani, Markus, et al.
Published: (2021)

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

Catching Rats in $H$-minor-free Graphs
by: Gorsky, Maximilian, et al.
Published: (2025)

A simple algorithm for checking equivalence of counting functions on free monoids
by: Kiyashko, Petr, et al.
Published: (2024)

Monotone Arc Diagrams with few Biarcs
by: Chaplick, Steven, et al.
Published: (2024)

On the twin-width of near-regular graphs
by: Heinrich, Irene, et al.
Published: (2025)

The price of homogeneity is polynomial
by: Gorsky, Maximilian, et al.
Published: (2026)