Cyclic arrangements with minimum modulo \(m\) winding numbers

DOI10.1007/s00373-021-02443-1zbMath1485.05019OpenAlexW4220755810MaRDI QIDQ2117515

Yanzhen Xiong, Chengyang Qian, Yaokun Wu

Publication date: 21 March 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02443-1

zbMATH Keywords

winding numbergray codecircular-ones propertyconsecutive-ones property

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorics on words (68R15) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Other types of codes (94B60) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Circular-arc hypergraphs: rigidity via connectedness
• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
• Balancing cyclic \(R\)-ary Gray codes. II.
• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Balanced Gray codes
• PC trees and circular-ones arrangements.
• An extension of a theorem of Fulkerson and Gross
• Obtaining matrices with the consecutive ones property by row deletions
• The maximum clique problem in multiple interval graphs
• Balancing cyclic \(R\)-ary Gray codes
• Incidence matrices and interval graphs
• Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices
• Matrix characterizations of circular-arc graphs
• De Bruijn digraphs and affine transformations
• A Bijective Proof of a Theorem of Knuth
• Interval Graphs: Canonical Representations in Logspace
• On double and multiple interval graphs
• Common coordinates in consecutive addresses
• Balanced Maximum Counting Sequences
• Twills with bounded float length
• Counting sequences
• The separability of standard cyclic N-ary Gray codes
• Characterization and linear‐time detection of minimal obstructions to concave‐round graphs and the circular‐ones property
• Completely uniformly distributed sequences based on de Bruijn sequences
• Combinatorial Configurations

This page was built for publication: Cyclic arrangements with minimum modulo \(m\) winding numbers