Subdirect decomposition of \(n\)-chromatic graphs

DOI10.1023/A:1008637811027zbMath0910.05025OpenAlexW2133512087MaRDI QIDQ1272897

Xavier Caicedo

Publication date: 9 April 1999

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008637811027

zbMATH Keywords

subdirect decompositionsubdirectly irreduciblessubdirect powers\(n\)-chromatic graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Quasivarieties (08C15) Subdirect products and subdirect irreducibility (08B26)

Related Items

Normal edge-transitive Cayley graphs and Frattini-like subgroups ⋮ On reconstruction of normal edge-transitive Cayley graphs ⋮ Open questions related to the problem of Birkhoff and Maltsev

Cites Work

• Unnamed Item
• Unnamed Item
• Subdirect decomposability into irreducibles
• On classes of relations and graphs determined by subobjects and factorobjects
• Productive classes and subdirect irreducibility, in particular for graphs
• Finitely axiomatizable quasivarieties of graphs
• The metamathematics of algebraic systems. Collected papers: 1936-1967. Translated, edited, and provided with supplementary notes by Benjamin Franklin Wells III
• Model companions for finitely generated universal Horn classes
• The First Order Theory of N-Colorable Graphs
• Subdirect representations in axiomatic classes
• Sheaf Constructions and Their Elementary Properties
• Subdirect representations of relational systems
• Atomic compactness and graph theory
• Subdirect unions in universal algebra