Well-quasi-order of relabel functions

DOI10.1007/s11083-010-9174-0zbMath1209.05210MaRDI QIDQ603891

Michaël Rao, Jean Daligault, Steéphan Thomassé

Publication date: 8 November 2010

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-010-9174-0

zbMATH Keywords

induced subgraph; clique-width; well-quasi-order

Mathematics Subject Classification ID

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

Related Items

Induced minors and well-quasi-ordering, Split permutation graphs, Forbidden substructures and combinatorial dichotomies: WQO and universality, Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes, Well-quasi-ordering Does Not Imply Bounded Clique-width

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• Characterizations for restricted graphs of NLC-width 2
• On well-quasi-ordering finite structures with labels
• Recent developments on graphs of bounded clique-width
• Theory of relations. Transl. from the French by P. Clote
• \(k\)-NLC graphs and polynomial algorithms
• Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
• Handle-rewriting hypergraph grammars
• The theory of well-quasi-ordering: a frequently discovered concept
• On Better-Quasi-Ordering Countable Series-Parallel Orders
• NLC₂-DECOMPOSITION IN POLYNOMIAL TIME
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Induced subgraphs and well‐quasi‐ordering
• Ordering by Divisibility in Abstract Algebras
• Graph-Theoretic Concepts in Computer Science