Image de couverture de livre

List Coloring of some Cayley graphs using Kernel perfections

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	S, Prajnanaswaroopa
Format:	Preprint
Publié:	2024
Sujets:	Combinatorics Discrete Mathematics Data Structures and Algorithms 05C15, 05C25 G.2.1; G.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Alon-Tarsi Number of Some Regular Graphs
par: Prajnanaswaroopa, S.
Publié: (2023)

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

Explicit two-sided unique-neighbor expanders
par: Hsieh, Jun-Ting, et autres
Publié: (2023)

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

On Relaxation of Dominant Sets
par: Koster, Max
Publié: (2022)

Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor
par: Bonnet, Édouard, et autres
Publié: (2023)

Exploration of $k$-edge-deficient temporal graphs in linear time
par: Lahtin, Ivan, et autres
Publié: (2026)

An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors
par: De Meyer, Lucas, et autres
Publié: (2025)

Killing a Vortex
par: Thilikos, Dimitrios M., et autres
Publié: (2022)

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
par: Masařík, Tomáš, et autres
Publié: (2026)

Bounds on the genus for 2-cell embeddings of prefix-reversal graphs
par: Blanco, Saúl A., et autres
Publié: (2023)

Bounds and Hardness Results for Conflict-free Choosability
par: Gupta, Shiwali, et autres
Publié: (2024)

Computing distances is FPT on graph associahedra and W[2]-hard on hypergraphic polytopes
par: Cunha, Luís Felipe I., et autres
Publié: (2025)

Excluding a Forest Induced Minor
par: Bonnet, Édouard, et autres
Publié: (2025)

Adjacent vertex distinguishing total coloring of 3-degenerate graphs
par: Behera, Diptimaya, et autres
Publié: (2025)

An Efficient Algorithm for Permutation Iteration Using a Singly Linked List
par: Baruchel, Thomas
Publié: (2025)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
par: Shota, Kan, et autres
Publié: (2024)

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
par: Adamson, Duncan, et autres
Publié: (2023)

A New Temporal Interpretation of Cluster Editing
par: Bocci, Cristiano, et autres
Publié: (2022)

A note on graphs with purely imaginary per-spectrum
par: Singh, Ranveer, et autres
Publié: (2022)

On the Metric Dimension of $K_a \times K_b \times K_c$
par: Gledel, Valentin, et autres
Publié: (2024)

Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?
par: Bom, David, et autres
Publié: (2025)

Flip-width: Cops and Robber on dense graphs
par: Toruńczyk, Szymon
Publié: (2023)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
par: Gabryelski, Wojciech, et autres
Publié: (2026)

Permanent of bipartite graphs in terms of determinants
par: Chakrabartty, Surabhi, et autres
Publié: (2025)

Coloring Graphs With No Totally Odd Clique Immersion
par: McFarland, Caleb
Publié: (2025)

Exact Minimum Weight Spanners via Column Generation
par: Bökler, Fritz, et autres
Publié: (2024)

Simple Approximations for General Spanner Problems
par: Bökler, Fritz, et autres
Publié: (2025)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
par: Chimani, Markus, et autres
Publié: (2021)

A Combinatorial Framework for the Pons-Batle Identity: Young Tableaux, Lattice Paths, and Limit Laws
par: Liu, Hexuan, et autres
Publié: (2026)

Cluster deletion and clique partitioning in graphs with bounded clique number
par: Galesi, Nicola, et autres
Publié: (2025)

Tree-independence number VI. Thetas and pyramids
par: Chudnovsky, Maria, et autres
Publié: (2025)

Tight bounds on adjacency labels for monotone graph classes
par: Bonnet, Édouard, et autres
Publié: (2023)

Benchmarking of algorithms for set partitions
par: Khinvasara, Arnav, et autres
Publié: (2026)

Temporalizing digraphs via linear-size balanced bi-trees
par: Bessy, Stéphane, et autres
Publié: (2023)

Colorful Minors
par: Protopapas, Evangelos, et autres
Publié: (2025)

Counting big Ramsey degrees of the homogeneous and universal $K_4$-free graph
par: Hubička, Jan, et autres
Publié: (2025)

Optimal Bounds for the k-Disjoint Paths Problem
par: Cavallaro, Dario, et autres
Publié: (2026)

Optimal List Recoloring of Subcubic Graphs and Complete Multipartite Graphs
par: De Meyer, Lucas
Publié: (2025)

A Customized SAT-based Solver for Graph Coloring
par: Brand, Timo, et autres
Publié: (2025)