We briefly present our point of view about conceptual graphs: graphs with ordered labels - for representing knowledge - with graph operations - for reasoning. We propose a formalism for simple conceptual graphs which generalizes the usually considered model, and preserves its fundamental properties. Links with important combinatorial notions (graph morphism, Constraint Satisfaction Problems) are established. Finally a notion of nested conceptual graph is fonnally defined, which significantly extends the simple model.