Cell-paths in mono- and bichromatic line arrangements in the plane

Combinatorics

Bibliographic Details
Published in:	Discrete Mathematics & Theoretical Computer Science
Main Authors:	Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2014-12-01
Subjects:	discrete geometry line arrangement planar graphs hamiltonicity [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/2088/pdf

Similar Items

On bipartite powers of bigraphs
by: Yoshio Okamoto, et al.
Published: (2012-08-01)

Centerpoint theorems for wedges
by: Jeff Erickson, et al.
Published: (2009-01-01)

On the chromatic number of some flip graphs
by: Ruy Fabila-Monroy, et al.
Published: (2009-01-01)

The Eulerian distribution on centrosymmetric involutions
by: Marilena Barnabei, et al.
Published: (2009-01-01)

Number of connected spanning subgraphs on the Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2009-01-01)

Coding partitions
by: Fabio Burderi, et al.
Published: (2007-01-01)

Interaction properties of relational periods
by: Vesa Halava, et al.
Published: (2008-01-01)

Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach
by: Gregory Nuel
Published: (2008-01-01)

On economical set representations of graphs
by: Jing Kong, et al.
Published: (2009-01-01)

Recurrence among trees with most numerous efficient dominating sets
by: Dorota Bród, et al.
Published: (2008-01-01)

Bounded-degree graphs have arbitrarily large queue-number
by: David R. Wood
Published: (2008-01-01)

Ambiguity in the m-bonacci numeration system
by: Petra Kocábová, et al.
Published: (2007-01-01)

Simultaneous generation for zeta values by the Markov-WZ method
by: Khodabakhsh Hessami Pilehrood, et al.
Published: (2008-01-01)

Gray code order for Lyndon words
by: Vincent Vajnovszki
Published: (2007-01-01)

The distribution of ascents of size d or more in compositions
by: Charlotte Brennan, et al.
Published: (2009-01-01)

On hereditary Helly classes of graphs
by: Marina Groshaus, et al.
Published: (2008-01-01)

On-line extensible bin packing with unequal bin sizes
by: Deshi Ye, et al.
Published: (2009-01-01)

Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System
by: Valerie Berthe, et al.
Published: (2009-03-01)

Counting descents, rises, and levels, with prescribed first element, in words
by: Sergey Kitaev, et al.
Published: (2008-01-01)

A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
by: David Callan
Published: (2008-01-01)

The determining number of Kneser graphs
by: José Cáceres, et al.
Published: (2013-01-01)

List edge and list total colorings of planar graphs without non-induced 7-cycles
by: Aijun Dong, et al.
Published: (2013-03-01)

Immersion containment and connectivity in color-critical graphs
by: Faisal N. Abu-Khzam, et al.
Published: (2012-10-01)

Acyclic chromatic index of fully subdivided graphs and Halin graphs
by: Manu Basavaraju
Published: (2012-10-01)

The competition number of a generalized line graph is at most two
by: Boram Park, et al.
Published: (2012-08-01)

Krausz dimension and its generalizations in special graph classes
by: Olga Glebova, et al.
Published: (2013-03-01)

Random Horn formulas and propagation connectivity for directed hypergraphs
by: Robert H. Sloan, et al.
Published: (2012-08-01)

All totally symmetric colored graphs
by: Mariusz Grech, et al.
Published: (2013-03-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-03-01)

A chip-firing variation and a new proof of Cayley's formula
by: Peter Mark Kayll, et al.
Published: (2013-03-01)

Clique cycle transversals in graphs with few P₄'s
by: Raquel Bravo, et al.
Published: (2013-09-01)

On quadratic threshold CSPs
by: Per Austrin, et al.
Published: (2012-11-01)

On the complexity of distributed BFS in ad hoc networks with non-spontaneous wake-ups
by: Dariusz Kowalski, et al.
Published: (2013-11-01)

Some results on stable sets for k-colorable P₆-free graphs and generalizations
by: Raffaele Mosca
Published: (2012-08-01)

A lower bound for approximating the Grundy number
by: Guy Kortsarz
Published: (2007-01-01)

Nordhaus-Gaddum Type Results for Total Domination
by: Michael Henning, et al.
Published: (2011-12-01)

FP/FIFO scheduling: coexistence of deterministic and probabilistic QoS guarantees
by: Pascale Minet, et al.
Published: (2007-01-01)

Recursions and divisibility properties for combinatorial Macdonald polynomials
by: Nicholas A. Loehr, et al.
Published: (2011-02-01)

The extended equivalence and equation solvability problems for groups
by: Gabor Horvath, et al.
Published: (2011-11-01)

New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree
by: Xin Zhang, et al.
Published: (2011-09-01)