import { AnalyzerGraph } from './types';
/**
 * Compute perfect graph property.
 * Perfect graphs have no odd holes or odd anti-holes.
 * @param g
 */
export declare const computePerfect: (g: AnalyzerGraph) => {
    kind: "perfect";
} | {
    kind: "imperfect";
} | {
    kind: "unconstrained";
};
/**
 * Compute split graph property (partition into clique + independent set).
 * @param g
 */
export declare const computeSplit: (g: AnalyzerGraph) => {
    kind: "split";
} | {
    kind: "non_split";
} | {
    kind: "unconstrained";
};
/**
 * Compute cograph property (P4-free graph).
 * @param g
 */
export declare const computeCograph: (g: AnalyzerGraph) => {
    kind: "cograph";
} | {
    kind: "non_cograph";
} | {
    kind: "unconstrained";
};
/**
 * Compute threshold graph property (split + cograph).
 * @param g
 */
export declare const computeThreshold: (g: AnalyzerGraph) => {
    kind: "threshold";
} | {
    kind: "non_threshold";
} | {
    kind: "unconstrained";
};
/**
 * Compute line graph property.
 * @param g
 */
export declare const computeLine: (g: AnalyzerGraph) => {
    kind: "line_graph";
} | {
    kind: "non_line_graph";
} | {
    kind: "unconstrained";
};
/**
 * Compute claw-free property (no K1,3 induced subgraph).
 * @param g
 */
export declare const computeClawFree: (g: AnalyzerGraph) => {
    kind: "claw_free";
} | {
    kind: "has_claw";
} | {
    kind: "unconstrained";
};
/**
 * Compute cubic graph property (3-regular).
 * @param g
 */
export declare const computeCubic: (g: AnalyzerGraph) => {
    kind: "cubic";
} | {
    kind: "non_cubic";
} | {
    kind: "unconstrained";
};
/**
 * Compute specific k-regular property.
 * @param g
 * @param k
 */
export declare const computeSpecificRegular: (g: AnalyzerGraph, k: number) => {
    kind: "k_regular";
    k: number;
} | {
    kind: "not_k_regular";
} | {
    kind: "unconstrained";
};
/**
 * Auto-detect k-regular property (find k if graph is regular).
 * @param g
 */
export declare const computeAutoRegular: (g: AnalyzerGraph) => {
    kind: "k_regular";
    k: number;
} | {
    kind: "not_k_regular";
} | {
    kind: "unconstrained";
};
/**
 * Compute strongly regular graph property.
 * Strongly regular: (n, k, λ, μ) where every vertex has degree k,
 * adjacent vertices have λ common neighbors, non-adjacent have μ common neighbors.
 * @param g
 */
export declare const computeStronglyRegular: (g: AnalyzerGraph) => {
    kind: "strongly_regular";
    k: number;
    lambda: number;
    mu: number;
} | {
    kind: "not_strongly_regular";
} | {
    kind: "unconstrained";
};
/**
 * Compute self-complementary property (graph isomorphic to its complement).
 * GI-complete, so this is expensive.
 * @param g
 */
export declare const computeSelfComplementary: (g: AnalyzerGraph) => {
    kind: "self_complementary";
} | {
    kind: "not_self_complementary";
} | {
    kind: "unconstrained";
};
/**
 * Compute vertex-transitive property.
 * GI-hard, so this is conservative.
 * @param g
 */
export declare const computeVertexTransitive: (g: AnalyzerGraph) => {
    kind: "vertex_transitive";
} | {
    kind: "not_vertex_transitive";
} | {
    kind: "unconstrained";
};
/**
 * Compute complete bipartite property K_{m,n}.
 * @param g
 */
/**
 * Compute complete bipartite property K_{m,n}.
 * @param g
 */
export declare const computeCompleteBipartite: (g: AnalyzerGraph) => {
    kind: "complete_bipartite";
    m: number;
    n: number;
} | {
    kind: "not_complete_bipartite";
} | {
    kind: "unconstrained";
};
//# sourceMappingURL=advanced-structures.d.ts.map