Flipping triangles and rectangles

DOI10.1007/s10878-012-9480-0zbMath1282.90214OpenAlexW2055036602MaRDI QIDQ386439

Ming-Hui Jiang

Publication date: 9 December 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9480-0

zbMATH Keywords

graph coloringflip graphshift graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring translates and homothets of a convex body
• Maximum matchings in regular graphs of high girth
• Flips in planar graphs
• Bounds for sorting by prefix reversal
• Flipping edges in triangulations
• Graph imperfection. I
• Arc colorings of digraphs
• A group-theoretic model for symmetric interconnection networks

This page was built for publication: Flipping triangles and rectangles