On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids

DOI10.1007/s00373-012-1190-yzbMath1272.05140arXiv1011.4888OpenAlexW3106322282MaRDI QIDQ367058

Juan José Montellano-Ballesteros, Eduardo Rivera-Campo

Publication date: 26 September 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

matroidgeometric graphheterochromatic number

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Some heterochromatic theorems for matroids ⋮ On the number of heterochromatic trees in nice and beautiful colorings of complete graphs

Cites Work

• Ramsey-type results for geometric graphs. I
• Edge-colorings of complete graphs that avoid polychromatic trees
• Packing trees into planar graphs
• On the minimum size of tight hypergraphs
• Unnamed Item

This page was built for publication: On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids