Pages that link to "Item:Q1072575"

The following pages link to Strict refinement for graphs and digraphs (Q1072575):

Displaying 9 items.

• Finding the prime factors of strong direct product graphs in polynomial time (Q686286) (← links)
• Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time (Q1098860) (← links)
• Products of abstract polytopes (Q1747772) (← links)
• \(\mathcal{M}\)-coextensive objects and the strict refinement property (Q2176089) (← links)
• Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time (Q2515582) (← links)
• (Q4261825) (← links)
• Groups for which it is easy to detect graphical regular representations (Q5045250) (← links)
• Digraphs with small automorphism groups that are Cayley on two nonisomorphic groups (Q5121544) (← links)
• The semigroup of metric measure spaces and its infinitely divisible probability measures (Q5506658) (← links)