Cyclic arrangements with minimum modulo \(m\) winding numbers
type: Item
instance of: scholarly article
title: Cyclic arrangements with minimum modulo \(m\) winding numbers
zbMATH Open document ID: 1485.05019
author: Chengyang Qian
author: Yaokun Wu
author: Yanzhen Xiong
published in: Graphs and Combinatorics
publication date: 2022-03-21T00:00:00Z
Mathematics Subject Classification ID: 05B20
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 94A55
Mathematics Subject Classification ID: 94B60
zbMATH DE Number: 7493894
zbMATH Keywords: circular-ones property
zbMATH Keywords: consecutive-ones property
zbMATH Keywords: gray code
zbMATH Keywords: winding number
MaRDI profile type: Publication
full work available at URL: s00373-021-02443-1
OpenAlex ID: W4220755810
cites work: Q5537621
cites work: Completely uniformly distributed sequences based on de Bruijn sequences
cites work: Balanced Gray codes
cites work: A Bijective Proof of a Theorem of Knuth
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Common coordinates in consecutive addresses
cites work: An extension of a theorem of Fulkerson and Gross
cites work: Q5747380
cites work: Q5834367
cites work: De Bruijn digraphs and affine transformations
cites work: Q3397627
cites work: Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
cites work: Balancing cyclic \(R\)-ary Gray codes. II.
cites work: Balancing cyclic \(R\)-ary Gray codes
cites work: The maximum clique problem in multiple interval graphs
cites work: Incidence matrices and interval graphs
cites work: Twills with bounded float length
cites work: PC trees and circular-ones arrangements.
cites work: Interval Graphs: Canonical Representations in Logspace
cites work: Circular-arc hypergraphs: rigidity via connectedness
cites work: Characterizations and recognition of circular-arc graphs and subclasses: a survey
cites work: Obtaining matrices with the consecutive ones property by row deletions
cites work: Counting sequences
cites work: Combinatorial Configurations
cites work: Characterization and linear‐time detection of minimal obstructions to concave‐round graphs and the circular‐ones property
cites work: Balanced Maximum Counting Sequences
cites work: On double and multiple interval graphs
cites work: Matrix characterizations of circular-arc graphs
cites work: Q5715090
cites work: The separability of standard cyclic N-ary Gray codes
cites work: Q3975295
cites work: Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices
DOI: 10.1007/S00373-021-02443-1
description: scientific article; zbMATH DE number 7493894