Vertex-colored encompassing graphs
From MaRDI portal
Publication:742604
DOI10.1007/S00373-013-1320-1zbMATH Open1298.05120OpenAlexW2083530426MaRDI QIDQ742604FDOQ742604
Authors: D. Kharzeev 
Publication date: 19 September 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1320-1
Recommendations
- scientific article; zbMATH DE number 7528064
- Triangulating Vertex-Colored Graphs
- scientific article; zbMATH DE number 437536
- Bounded vertex colorings of graphs
- Vertex-distinguishing total coloring of graphs
- Vertex-distinguishing edge colorings of graphs
- Vertex rainbow colorings of graphs
- Vertex coloring of graphs with few obstructions
- Vertex coloring edge-weighted digraphs
- scientific article; zbMATH DE number 6129492
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Computational geometry. Algorithms and applications.
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Euclidean shortest paths in the presence of rectilinear barriers
- Title not available (Why is that?)
- Simple alternating path problem
- Constructing plane spanners of bounded degree and low weight
- Generalized Delaunay triangulation for planar graphs
- Segment endpoint visibility graphs are Hamiltonian
- Relative convex hulls in semi-dynamic arrangements
- Planar bichromatic minimum spanning trees
- Encompassing colored planar straight line graphs
- A vertex-face assignment for plane graphs
- Every set of disjoint line segments admits a binary tree
- Title not available (Why is that?)
- Growing a Tree from Its Branches
- Pointed binary encompassing trees: simple and optimal
- Alternating paths through disjoint line segments
- Title not available (Why is that?)
- ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
Cited In (7)
- Properly colored geometric matchings and 3-trees without crossings on multicolored points in the plane
- Vertex coverings by coloured induced graphs — Frames and Umbrellas
- Discrete geometry on colored point sets in the plane -- a survey
- Plane bichromatic trees of low degree
- Linear transformation distance for bichromatic matchings
- Encompassing colored planar straight line graphs
- A vertex-face assignment for plane graphs
This page was built for publication: Vertex-colored encompassing graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742604)
