Unique Factorization Theorem and Formal Concept Analysis

DOI10.1007/978-3-540-78921-5_16zbMath1133.05306OpenAlexW1603499902MaRDI QIDQ5452428

Peter Mihók, Gabriel Semanisin

Publication date: 4 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78921-5_16

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Lattices (06B99)

Related Items (1)

Using congruence relations to extract knowledge from concept lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
• On uniquely partitionable relational structures and object systems
• On the structure of hereditary classes of graphs
• A survey of hereditary properties of graphs
• On the lattice of additive hereditary properties of finite graphs
• Unique factorization theorem
• Canonical Vertex Partitions
• Unique factorisation of additive induced-hereditary properties
• Factorizations and characterizations of induced‐hereditary and compositive properties
• Criteria of the existence of uniquely partionable graphs with respect to additive induced-hereditary properties
• Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors
• A Generalized Concept Lattice
• 25 pretty graph colouring problems

This page was built for publication: Unique Factorization Theorem and Formal Concept Analysis