scientific article; zbMATH DE number 1775538

MaRDI QIDQ4544370zbMATH OpenFDO

Authors Benoît Larose, Claude Tardif

Publication date 4 August 2002

zbMATH Keywords

relational structure

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Operations and polynomials in algebraic structures, primal algebras (08A40)

Recommendations

• Families of strongly projective graphs
• scientific article; zbMATH DE number 774085
• Propriétés de projection des relations binaires
• Rigid binary relations on a 4-element domain
• Projection properties and reflexive binary relations

Cited in

(16)

• Rigid tensegrity labelings of graphs
• On sparse graphs with given colorings and homomorphisms.
• Incidence structures and Stone-Priestley duality
• Note on projective graphs
• Independent sets of maximal size in tensor powers of vertex-transitive graphs
• Propriétés de projection des relations binaires
• Families of strongly projective graphs
• Rigid binary relations on a 4-element domain
• scientific article; zbMATH DE number 6470135 (Why is no real title available?)
• Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
• Projection properties and reflexive binary relations
• Towards tight bounds for the graph homomorphism problem parameterized by cutwidth via asymptotic matrix parameters
• The fine-grained complexity of graph homomorphism parameterized by clique-width
• Fine-grained complexity of the list homomorphism problem: feedback vertex set and cutwidth
• H-coloring dichotomy revisited
• When is a random graph projective?

This page was built for publication:

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