Cover Image

Graph drawing applications in combinatorial theory of maturity models

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kajzer, Špela, Dobler, Alexander, Jerebic, Janja, Nöllenburg, Martin, Orthaber, Joachim, Bokal, Drago
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles
by: Aichholzer, Oswin, et al.
Published: (2024)

Faces in rectilinear drawings of complete graphs
by: Balko, Martin, et al.
Published: (2025)

Holes in Convex and Simple Drawings
by: Bergold, Helena, et al.
Published: (2024)

Plane Hamiltonian Cycles in Convex Drawings
by: Bergold, Helena, et al.
Published: (2024)

Coloring Mixed and Directional Interval Graphs
by: Gutowski, Grzegorz, et al.
Published: (2022)

Edge densities of drawings of graphs with one forbidden cell
by: Hahn, Benedikt, et al.
Published: (2025)

Distribution of codewords on the faces of a hypercube and new combinatorial identities
by: Abdurakhmanov, Jamolidin K.
Published: (2025)

ELECTRE TRI-nB, pseudo-disjunctive: axiomatic and combinatorial results
by: Bouyssou, Denis, et al.
Published: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
by: Kurapov, Sergey, et al.
Published: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
by: Kurapov, Sergey, et al.
Published: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
by: Kurapov, Sergey, et al.
Published: (2025)

Playing Snake on a Graph
by: Graafsma, Denise, et al.
Published: (2025)

Grid-drawings of graphs in three-dimensions
by: Balogh, Jozsef, et al.
Published: (2024)

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

Coloring and Recognizing Directed Interval Graphs
by: Gutowski, Grzegorz, et al.
Published: (2023)

Algorithmic methods of finite discrete structures. Topological graph drawing (part III)
by: Kurapov, Sergey, et al.
Published: (2025)

Dynamical Stability of Threshold Networks over Undirected Signed Graphs
by: Goles, Eric, et al.
Published: (2023)

An Efficient Genus Algorithm Based on Graph Rotations
by: Metzger, Alexander, et al.
Published: (2024)

Functional design of efficient and parallelizable combinatorial generators using convolution
by: He, Xi, et al.
Published: (2025)

Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
by: Montanez-Barrera, Alejandro, et al.
Published: (2022)

Tree decompositions whose trees are subgraphs: An application of Simon's factorization
by: Bourneuf, Romain, et al.
Published: (2026)

Hypergraph Representation via Axis-Aligned Point-Subspace Cover
by: Firman, Oksana, et al.
Published: (2021)

Study on (r,s)- Generalised Transformation Graphs, A Novel Perspective Based on Transformation Graphs
by: Ali, Parvez, et al.
Published: (2024)

Broadcast Graph Is NP-complete
by: Xu, Jinghan, et al.
Published: (2024)

Boxicity of Zero Divisor Graphs
by: Chandran, L. Sunil, et al.
Published: (2025)

Axioms for Distanceless Graph Partitioning
by: Willson, James, et al.
Published: (2023)

Robust Filter Design for Graph Signals
by: Testa, Lucia, et al.
Published: (2024)

Cops & Robber on Periodic Temporal Graphs
by: De Carufel, Jean-Lou, et al.
Published: (2024)

Convergence Properties of Dynamic Processes on Graphs
by: Horscroft, Timothy
Published: (2024)

Cartesian Prime Graphs and Cospectral Families
by: Bitragunta, Abhinav, et al.
Published: (2025)

Graph Theoretic Investigations on Inefficiencies in Network Models
by: Cenciarelli, Pietro, et al.
Published: (2016)

Turán Graphs, Stability Number, and Fibonacci Index
by: Bruyère, Véronique, et al.
Published: (2008)

Stereotype graph: A mathematical framework of category stereotypes via graph theory
by: Yan, Yijia
Published: (2025)

Optical orthogonal codes from a combinatorial perspective
by: Huczynska, Sophie, et al.
Published: (2024)

Traversing combinatorial 0/1-polytopes via optimization
by: Merino, Arturo, et al.
Published: (2023)

The Complexity of Cluster Vertex Splitting and Company
by: Firbas, Alexander, et al.
Published: (2023)

Weighted Treedepth is NP-complete on Graphs of Bounded Degree
by: Dirks, Jona, et al.
Published: (2025)

How to Color Temporal Graphs to Ensure Proper Transitions
by: Ibiapina, Allen, et al.
Published: (2025)

A Weight Function Lemma Heuristic for Graph Pebbling
by: Bridi, G. A., et al.
Published: (2025)

Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs
by: Friedrich, Tobias, et al.
Published: (2023)