On asymptotic packing of convex geometric and ordered graphs

DOI10.1002/jgt.23002zbMath1526.05117arXiv2207.11624MaRDI QIDQ6062874

Ji Zeng, Unnamed Author, Jiaxi Nie

Publication date: 6 November 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.11624

zbMATH Keywords

packing problemordered graphcyclic chromatic numberconvex geometric graphinterval chromatic number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial and computational aspects of graph packing and graph decomposition
• Asymptotic behavior of the chromatic index for hypergraphs
• On a packing and covering problem
• The book thickness of a graph
• On the Turán number of some ordered even cycles
• Chromatic number of ordered graphs with forbidden ordered subgraphs
• On asymptotic packing of geometric graphs
• Ordered and convex geometric trees with linear extremal function
• Packing plane spanning trees into a point set
• Forbidden paths and cycles in ordered graphs and matrices
• Partitions of complete geometric graphs into plane trees
• Packing plane spanning trees and paths in complete geometric graphs
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹

This page was built for publication: On asymptotic packing of convex geometric and ordered graphs