Well‐quasi‐ordering and finite distinguishing number

DOI10.1002/jgt.22523zbMath1486.05257OpenAlexW2991189430WikidataQ126651292 ScholiaQ126651292MaRDI QIDQ5066907

Robert Brignall, Aistis Atminas

Publication date: 31 March 2022

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22523

zbMATH Keywords

speedhereditary propertywell-quasi-ordergraph class

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) Combinatorics of partially ordered sets (06A07) Structural characterization of families of graphs (05C75) Generalizations of ordered sets (06A75)

Related Items (5)

The Micro-world of Cographs ⋮ The micro-world of cographs ⋮ Critical properties of bipartite permutation graphs ⋮ Critical properties and complexity measures of read-once Boolean functions ⋮ Hereditary classes of graphs: a parametric approach

This page was built for publication: Well‐quasi‐ordering and finite distinguishing number