VIZING’S CONJECTURE FOR CHORDAL GRAPHS ´ RON AHARONI AND TIBOR SZABO Abstract. Vizing [13] conjectured that γ(GH) ≥ γ(G)γ(H) for every pair G, H of graphs, where “” is the Cartesian product, and γ(G) is th

Source URL: page.mi.fu-berlin.de

Chromatic number for a generalization of Cartesian product graphs Daniel Kr´al’∗ Douglas B. West†

Source URL: iti.mff.cuni.cz

The Cover Time of Cartesian Product Graphs Mohammed Amin Abdullah Colin Cooper Tomasz Radzik

Source URL: www.mohammedabdullah.com

Combinatorial Reasoning in Information Theory Noga Alon∗ Abstract Combinatorial techniques play a crucial role in the investigation of problems in Information Theory. We describe a few representative examples, focusing

Source URL: www.math.tau.ac.il

• Graph coloring
• NP-complete problems
• Cartesian product of graphs
• Lovász number
• Graph theory
• Induced path
• Degeneracy

Stochastic Kronecker Graphs Mohammad Mahdian∗ Ying Xu† Abstract

Source URL: theory.stanford.edu

• Random graph
• Degree
• Orbifold
• Cartesian product of graphs
• Graph theory
• Mathematics
• Theoretical computer science

Extending Functional Dependency to Detect Abnormal Data in RDF Graphs Yang Yu and Jeff Heflin Department of Computer Science and Engineering. Lehigh University 19 Memorial Drive West, Bethlehem, PA 18015 {yay208,heflin

Source URL: swat.cse.lehigh.edu

• Database constraints
• Database theory
• Functional dependency
• Mutual information
• Cartesian product
• Correlation and dependence
• Function
• Data dependency
• Mathematics
• Data modeling
• Data management