Cover Image

Partitioning a Planar Graph into two Triangle-Forests

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Knauer, Kolja, Rambaud, Clément, Ueckerdt, Torsten
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Clustered independence and bounded treewidth
by: Knauer, Kolja, et al.
Published: (2023)

Odd coloring graphs with linear neighborhood complexity
by: Davies, James, et al.
Published: (2025)

Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
by: Goetze, Miriam, et al.
Published: (2024)

Concepts of Dimension for Convex Geometries
by: Knauer, Kolja, et al.
Published: (2023)

What is and is not inside a Cayley graph?
by: Knauer, Kolja, et al.
Published: (2025)

Excluding a rectangular grid
by: Rambaud, Clément
Published: (2025)

Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
by: Schneider, Samuel, et al.
Published: (2025)

A Note on Polychromatic Colorings of Shift-Chains
by: Ueckerdt, Torsten
Published: (2024)

Hamiltonian connectivity of some base-cobase graphs
by: Martínez-Sandoval, Leonardo, et al.
Published: (2025)

On rigid regular graphs and a problem of Babai and Pultr
by: Knauer, Kolja, et al.
Published: (2025)

Lattice path matroids and quotients
by: Benedetti, Carolina, et al.
Published: (2022)

Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)

Directed Acyclic Outerplanar Graphs Have Constant Stack Number
by: Jungeblut, Paul, et al.
Published: (2022)

Sensitivity of $m$-ary functions and low degree partitions of Hamming graphs
by: Asensio, Sara, et al.
Published: (2024)

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
by: Goetze, Miriam, et al.
Published: (2025)

Neighborhood complexity of planar graphs
by: Joret, Gwenaël, et al.
Published: (2023)

Partitions of planar (oriented) graphs into a connected acyclic and an independent set
by: Cambie, Stijn, et al.
Published: (2024)

Subdivisions in dicritical digraphs with large order or digirth
by: Picasarri-Arrieta, Lucas, et al.
Published: (2024)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
by: Claus, Quentin, et al.
Published: (2026)

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

Cops and Robber -- When Capturing is not Surrounding
by: Jungeblut, Paul, et al.
Published: (2023)

Diameter of the inversion graph
by: Havet, Frédéric, et al.
Published: (2024)

On the $(\leq p)$-inversion diameter of oriented graphs
by: Havet, Frédéric, et al.
Published: (2026)

On the minimum number of arcs in $4$-dicritical oriented graphs
by: Havet, Frédéric, et al.
Published: (2023)

On the minimum number of inversions to make a digraph $k$-(arc-)strong
by: Duron, Julien, et al.
Published: (2023)

Intersection Graphs with and without Product Structure
by: Merker, Laura, et al.
Published: (2024)

Quickly excluding an apex-forest
by: Hodor, Jędrzej, et al.
Published: (2024)

Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Centered colorings in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Centered colorings and weak coloring numbers in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2026)

Sample compression schemes for balls in structurally sparse graphs
by: Bourneuf, Romain, et al.
Published: (2026)

Primal-Dual Cops and Robber
by: Ha, Minh Tuan, et al.
Published: (2023)

Tight bound on treedepth in terms of pathwidth and longest path
by: Hatzel, Meike, et al.
Published: (2023)

Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)

3-Colouring Planar Graphs
by: Dujmović, Vida, et al.
Published: (2025)

Treewidth of Outer $k$-Planar Graphs
by: Pyzik, Rafał
Published: (2025)

Flipping Non-Crossing Spanning Trees
by: Bjerkevik, Håvard Bakke, et al.
Published: (2024)

Counting the Number of Domatic Partition of a Graph
by: Alikhani, Saeid, et al.
Published: (2024)

On 1-Planar Graphs with Bounded Cop-Number
by: Bose, Prosenjit, et al.
Published: (2024)

Face-hitting Dominating Sets in Planar Graphs
by: Francis, P., et al.
Published: (2024)