THE CONE OF BALANCED SUBGRAPHS AMITAVA BHATTACHARYA, URI N. PELED, AND MURALI K. SRINIVASAN Dedicated to the memory of Malka Peled Abstract. In this paper we study a 2-color analog of the cycle cone of a graph. Suppose t

Source URL: www.math.iitb.ac.in

Understanding Version 11 Accreditation Standards Cycle of Assessment: Linking Outcomes to Accreditation Standards (Graph 1: Cycle of Assessment) 1. Identify/Revise Mission (Key Element I-A) o Define Program Mission and a

Source URL: dx5br1z4f6n0k.cloudfront.net

Graph Theory - Solutions November 18, Warmup: Cycle graphs

Source URL: math.colorado.edu

5 Math. & Sci. hum. / Mathematics and Social Sciences (42e année, n° 168, 2004(4), pRING COHESION THEORY IN MARRIAGE AND SOCIAL NETWORKS1 Douglas R. WHITE2

Source URL: eclectic.ss.uci.edu

• Graph theory
• Social networks
• Graph operations
• Graph
• Structural endogamy
• Structural cohesion
• Induced subgraph
• Vertex
• Cycle
• Bipartite graph
• Line graph

On factorial properties of chordal bipartite graphs Konrad Dabrowski∗ Vadim V. Lozin† Victor Zamaraev‡

Source URL: community.dur.ac.uk

• Graph theory
• Bipartite graphs
• Graph operations
• NP-complete problems
• Chordal bipartite graph
• Chordal graph
• Distance-hereditary graph
• Matching
• Line graph
• Split graph
• Graph
• Cycle

Building and Comparing Qualitative Descriptions of Three-Dimensional Design Sketches Andrew Lovett Morteza Dehghani Kenneth Forbus {andrew-lovett@, morteza@cs., forbus@}northwestern.edu

Source URL: silccenter.org

• Mathematics
• 3D computer graphics
• Geometry
• Discrete mathematics
• Graph
• Graph theory
• Computer representation of surfaces
• Image segmentation
• Cycle
• Edge

Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office

Source URL: pagesperso.lina.univ-nantes.fr

• Graph theory
• Mathematics
• NP-complete problems
• Graph coloring
• Matching
• Bipartite graph
• Color-coding
• Treewidth
• Graph
• Cycle
• Line graph
• Chromatic polynomial

Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that

Source URL: page.math.tu-berlin.de

• Graph theory
• Kneser graph
• Petersen graph
• Odd graph
• Hamiltonian path
• Graph
• Cycle
• Planar graphs
• Desargues graph
• Polyhedral graph

TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

Source URL: www.iwr.uni-heidelberg.de

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Graph
• Travelling salesman problem
• Vertex
• Cycle
• Hamiltonian path
• Graph automorphism
• Vertex cover

Kronos: The Design and Implementation of an Event Ordering Service Robert Escriva Ayush Dubey

Source URL: cs.uwaterloo.ca

• Graph theory
• Mathematics
• Discrete mathematics
• Directed acyclic graph
• Topological sorting
• Graph
• Vertex
• Cycle
• NoSQL