Convex-Round and Concave-Round Graphs

DOI10.1137/S0895480197322154zbMath0941.05056OpenAlexW2094946507MaRDI QIDQ4490778

Jing Huang, Anders Yeo, Jörgen Bang-Jensen

Publication date: 20 July 2000

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480197322154

zbMATH Keywords

Hamiltonian cyclerecognitionmaximum matchingcoloringmaximum cliquelinear algorithmsproper circular arc graphsround graphsround enumeration

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Solving the canonical representation and star system problems for proper circular-arc graphs in logspace ⋮ Essential obstacles to Helly circular-arc graphs ⋮ Circular-arc hypergraphs: rigidity via connectedness ⋮ Convex-round graphs are circular-perfect

This page was built for publication: Convex-Round and Concave-Round Graphs