Covering partial cubes with zones

DOI10.1007/978-3-319-13287-7_1zbMath1343.05120arXiv1312.2819OpenAlexW1935923157MaRDI QIDQ888589

Jean Cardinal, Stefan Felsner

Publication date: 2 November 2015

Published in: The Electronic Journal of Combinatorics, Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

partial ordersacyclic orientationsset coverpartial cubes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorics of partially ordered sets (06A07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

There are no finite partial cubes of girth more than 6 and minimum degree at least 3 ⋮ General position subsets and independent hyperplanes in \(d\)-space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on coloring line arrangements
• Graphs and cubes
• A poset-based approach to embedding median graphs in hypercubes and lattices
• A density version of the Hales-Jewett theorem for \(k=3\)
• Two-colouring all two-element maximal antichains
• Fibres and ordered set coloring
• Hitting all maximal independent sets of a bipartite graph
• Linear Extension Diameter of Downset Lattices of 2-Dimensional Posets
• Learning Spaces
• Maximal Independent Subsets in Steiner Systems and in Planar Sets
• Median Graphs and Triangle-Free Graphs
• Notes on acyclic orientations and the shelling lemma

This page was built for publication: Covering partial cubes with zones