Image de couverture de livre

Small-scale operations on graphic sequences

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Rusu, Irena
Format:	Preprint
Publié:	2026
Sujets:	Combinatorics Discrete Mathematics 05C90, 05C85, 68R10
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Infinite families of planar graphs of a given injective chromatic number
par: Daneels, Matias, et autres
Publié: (2024)

Computational methods for finding bi-regular cages
par: Goedgebeur, Jan, et autres
Publié: (2024)

Improved bounds for acyclic coloring parameters
par: Kirousis, Lefteris, et autres
Publié: (2022)

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
par: Furmańczyk, Hanna, et autres
Publié: (2020)

A greedy heuristic for graph burning
par: García-Díaz, Jesús, et autres
Publié: (2024)

Weighted domination models and randomized heuristics
par: Dijkstra, Lukas, et autres
Publié: (2022)

New Vertex Ordering Characterizations of Circular-Arc Bigraphs
par: Paul, Indrajit, et autres
Publié: (2025)

An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
par: Mkrtchyan, Vahan
Publié: (2024)

Symmetric properties and two variants of shuffle-cubes
par: Lü, Huazhong, et autres
Publié: (2021)

Catching Rats in $H$-minor-free Graphs
par: Gorsky, Maximilian, et autres
Publié: (2025)

Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
par: Gollin, J. Pascal, et autres
Publié: (2023)

On algorithmic applications of sim-width and mim-width of $(H_1, H_2)$-free graphs
par: Munaro, Andrea, et autres
Publié: (2022)

Thick Forests
par: Dyer, Martin, et autres
Publié: (2023)

Solving the Graph Burning Problem for Large Graphs
par: Pereira, Felipe de Carvalho, et autres
Publié: (2024)

Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces
par: Paul, Christophe, et autres
Publié: (2024)

The Local Structure Theorem for Graph Minors with finite index
par: Paul, Christophe, et autres
Publié: (2025)

Totally $Δ$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
par: McFarland, Caleb
Publié: (2026)

An efficient algorithm for generating transmission irregular trees
par: Stošić, Ivan, et autres
Publié: (2025)

W-state graphs: Structure and Algorithms
par: Gajjala, Rishikesh, et autres
Publié: (2026)

Approximating branchwidth on parametric extensions of planarity
par: Thilikos, Dimitrios M., et autres
Publié: (2023)

Census Dual Graphs: Properties and Random Graph Models
par: Anderson, Sara, et autres
Publié: (2026)

Lower Bounds for the Pfaffian Number of Graphs
par: Junchaya, Enrique, et autres
Publié: (2026)

Maximizing the number of integer pairs summing to powers of 2 via graph labeling and solving restricted systems of linear (in)equations
par: Alekseyev, Max A.
Publié: (2023)

Polynomial Bounds for the Graph Minor Structure Theorem
par: Gorsky, Maximilian, et autres
Publié: (2025)

Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
par: Inoue, Yuta, et autres
Publié: (2024)

On Edge-Disjoint Maximal Outerplanar Graphs
par: Okada, Yuto, et autres
Publié: (2026)

Structure of $k$-Matching-Planar Graphs
par: Hendrey, Kevin, et autres
Publié: (2025)

Towards Characterization of 5-List-Colorability of Toroidal Graphs
par: Dvořák, Zdeněk, et autres
Publié: (2024)

On the Complexity of Distance-$d$ Independent Set Reconfiguration
par: Hoang, Duc A.
Publié: (2022)

Minimal $L^p$-congestion spanning trees on weighted graphs
par: Lafuente, Alberto Castejón, et autres
Publié: (2025)

Word-Representability of Graphs with respect to Split Recomposition
par: Dwary, Tithi, et autres
Publié: (2024)

Symmetry classes of Hamiltonian cycles
par: Baligacs, Julia, et autres
Publié: (2025)

The Directed Disjoint Paths Problem with Congestion
par: Bentert, Matthias, et autres
Publié: (2025)

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

4-cop-win graphs have at least 19 vertices
par: Turcotte, Jérémie, et autres
Publié: (2020)

Analyzing Network Robustness via Residual Closeness
par: Golpek, Hande Tuncel, et autres
Publié: (2026)

Cycles of Well-Linked Sets I: an Elementary Bound for Directed Cycle Packing
par: Hatzel, Meike, et autres
Publié: (2024)

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

Extremal Results on Conflict-free Coloring
par: Bhyravarapu, Sriram, et autres
Publié: (2023)

Paired many-to-many 2-disjoint path cover of Johnson graphs
par: Liu, Jinhao, et autres
Publié: (2025)