990 search results - page 14 / 198 » Sub-Graphs of Complete Graph |
91
Voted
JCO
2007
14 years 11 months ago
2007
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...
GD
1998
Springer
15 years 3 months ago
1998
Springer
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...
85
Voted
FLOPS
2004
Springer
15 years 5 months ago
2004
Springer
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in which a finite fragment denotes the class of graphs with bounded tree width.
87
Voted
DM
2010
14 years 11 months ago
2010
In this paper we give a full characterization of the idomatic partitions of the direct product of three complete graphs. We also show how to use such a characterization in order t...
63
Voted
JGT
2008
14 years 11 months ago
2008
We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1-factors whose union is the whole graph and, when these conditions are satisf...