Well‐quasi‐ordering and finite distinguishing number

DOI10.1002/JGT.22523zbMATH Open1486.05257OpenAlexW2991189430WikidataQ126651292 ScholiaQ126651292MaRDI QIDQ5066907FDOQ5066907

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

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

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)

Cited In (9)

• The micro-world of cographs
• Critical properties of bipartite permutation graphs
• Hereditary classes of graphs: a parametric approach
• On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
• Critical properties and complexity measures of read-once Boolean functions
• Deciding the Bell number for hereditary graph properties
• 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)