Cover Image

Awesome graph parameters

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Štorgel, Kenny Bešter, Dallard, Clément, Lozin, Vadim, Milanič, Martin, Zamaraev, Viktor
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics Data Structures and Algorithms 05C75 (Primary), 05D10, 05C69, 05C65, 05C85 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
by: Dallard, Clément, et al.
Published: (2024)

Functionality of box intersection graphs
by: Dallard, Clément, et al.
Published: (2023)

Induced Minor Models. I. Structural Properties and Algorithmic Consequences
by: Bousquet, Nicolas, et al.
Published: (2024)

Excluding an induced wheel minor in graphs without large induced stars
by: Choi, Mujin, et al.
Published: (2025)

Conformality of Minimal Transversals of Maximal Cliques
by: Boros, Endre, et al.
Published: (2024)

A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor
by: Milanič, Martin, et al.
Published: (2024)

Tree independence number V. Walls and claws
by: Chudnovsky, Maria, et al.
Published: (2025)

Young domination on Hamming rectangles
by: Gravner, Janko, et al.
Published: (2025)

The Upper Clique Transversal Problem
by: Milanič, Martin, et al.
Published: (2023)

Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
by: Boros, Endre, et al.
Published: (2023)

Tree decompositions meet induced matchings: beyond Max Weight Independent Set
by: Lima, Paloma T., et al.
Published: (2024)

On Intersection Graphs of Graphs and Hypergraphs: A Survey
by: Naik, Ranjan N.
Published: (2018)

Layered tree-independence number and clique-based separators
by: Dallard, Clément, et al.
Published: (2025)

On $\{k\}$-Roman graphs: complexity of recognition and the case of split graphs
by: Štorgel, Kenny Bešter, et al.
Published: (2025)

Packing coloring of hypercubes with extended Hamming codes
by: Gregor, Petr, et al.
Published: (2023)

Branch-width of connectivity functions is fixed-parameter tractable
by: Korhonen, Tuukka, et al.
Published: (2026)

Pathographs and some (un)decidability results
by: Carter, Daniel, et al.
Published: (2025)

Treewidth versus clique number: induced minors
by: Hilaire, Claire, et al.
Published: (2024)

Treewidth versus clique number. V. Further connections with tree-independence number
by: Hilaire, Claire, et al.
Published: (2025)

A simple quadratic kernel for Token Jumping on surfaces
by: Cranston, Daniel W., et al.
Published: (2024)

On the joint embedding property for cographs and trees
by: Carter, Daniel
Published: (2024)

Isolation critical graphs under multiple edge subdivision
by: Bartolo, Karl, et al.
Published: (2026)

Tree-independence number VI. Thetas and pyramids
by: Chudnovsky, Maria, et al.
Published: (2025)

Roman $\{2\}$-domination on Graphs with "few" 4-paths
by: Fernández, Lara, et al.
Published: (2025)

On coloring graphs with well-distributed edge density
by: Hassan, Syed Mujtaba, et al.
Published: (2024)

Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
by: Anil, Arun, et al.
Published: (2023)

Excluding a Forest Induced Minor
by: Bonnet, Édouard, et al.
Published: (2025)

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems
by: Grigoriev, Alexander, et al.
Published: (2025)

The Path-Extremal Conjecture for Zero Forcing: Distance-Hereditary Graphs and a Split-Decomposition Reduction
by: German, Samuel
Published: (2026)

$t$-sails and sparse hereditary classes of unbounded tree-width
by: Cocks, Daniel
Published: (2023)

Finding hypergraph immersion is fixed-parameter tractable
by: Meng, Xiangyi, et al.
Published: (2024)

Perfect phylogenies via the Minimum Uncovering Branching problem: efficiently solvable cases
by: Baghirova, Narmina, et al.
Published: (2025)

Finding irrelevant vertices in linear time on bounded-genus graphs
by: Golovach, Petr A., et al.
Published: (2019)

Four Dominion Growth Regimes in Trees: Forcing, Fibonacci Enumeration, Periodicity, and Stability
by: Allagan, Julian, et al.
Published: (2026)

When all directed cycles have the same weight
by: Berger, Eli, et al.
Published: (2026)

$5$-list-coloring toroidal $6$-regular triangulations in linear time
by: Balachandran, Niranjan, et al.
Published: (2021)

The Antisymmetric Line Graph
by: Bal, Hartosh Singh
Published: (2026)

Improved lower bounds for the maximum order of an induced acyclic subgraph
by: Asgarli, Shamil, et al.
Published: (2025)

Functionality of Random Graphs
by: Sylvester, John, et al.
Published: (2024)

On 3-Coloring of $(2P_4,C_5)$-Free Graphs
by: Jelínek, Vít, et al.
Published: (2020)