Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position

DOI10.1002/rsa.20153zbMath1109.05094OpenAlexW4232444617MaRDI QIDQ3419616

József Balogh, Boris G. Pittel, Gelasio Salazar

Publication date: 7 February 2007

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20153

zbMATH Keywords

matchingpathgraceful labelingharmonious labelingpoint setsharmonic graph

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Paths and cycles (05C38) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

A note on harmonic subgraphs in labelled geometric graphs ⋮ A note on two geometric paths with few crossings for points labeled by integers in the plane

Cites Work

• Graph Drawing
• Unnamed Item
• Unnamed Item

This page was built for publication: Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position