Convex-Round and Concave-Round Graphs
From MaRDI portal
Publication:4490778
DOI10.1137/S0895480197322154zbMath0941.05056MaRDI 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)
Hamiltonian cycle; recognition; maximum matching; coloring; maximum clique; linear algorithms; proper circular arc graphs; round graphs; round enumeration
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Solving the canonical representation and star system problems for proper circular-arc graphs in logspace, Circular-arc hypergraphs: rigidity via connectedness, Essential obstacles to Helly circular-arc graphs, Convex-round graphs are circular-perfect