Well‐quasi‐ordering and finite distinguishing number

DOI10.1002/JGT.22523MaRDI QIDQ5066907zbMATH OpenOpenAlexWikidataFDO

Authors Aistis Atminas, Robert Brignall

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

hereditary propertyspeedwell-quasi-ordergraph class

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 475611
• On well-quasi-ordering finite sequences
• Well quasi-ordered sets
• Well-quasi-ordering hereditarily finite sets
• Well-quasi-ordering hereditarily finite sets
• Well quasi-order in combinatorics: embeddings and homomorphisms
• On well-quasi-ordering finite structures with labels
• Well quasi-orders arising from finite ordered semigroups
• Well Quasi Orders and the Shuffle Closure of Finite Sets
• scientific article; zbMATH DE number 559140

Cited in

(9)

• On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
• Critical properties and complexity measures of read-once Boolean functions
• Hereditary classes of graphs: a parametric approach
• Deciding the Bell number for hereditary graph properties
• The micro-world of cographs
• Critical properties of bipartite permutation graphs
• Deciding the Bell number for hereditary graph properties
• Well-quasi-ordering and finite distinguishing number
• The Micro-world of Cographs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5066907)