Страницы без интервики-ссылок

Ниже показано до 500 результатов в диапазоне от 501 до 1000.

501. Connected hierarchical graph
502. Connected hypergraph
503. Connected set of vertices
504. Connected to relation
505. Connected vertices
506. Connective index
507. Connectivity
508. Connectivity axioms
509. Connectivity function
510. Connectivity matrix
511. Consecutive adjacent graph
512. Consecutive labeling
513. Constructible graph
514. Constructing enumeration
515. Constructing order
516. Containment graph
517. Context-free grammar
518. Context-free language
519. Context-sensitive grammar
520. Context-sensitive language
521. Contrabasis
522. Contractable edge
523. Contracted visibility graph
524. Contracting edge, contraction of an edge
525. Contraction of a graph
526. Contraction of an even pair
527. Contrafunctional graph
528. Control dependence
529. Control flow graph
530. Converse digraph
531. Convex bipartite graph
532. Convex dominating set
533. Convex domination number
534. Convex linear graph
535. Convex set in G
536. Coordinated graph
537. Corank function of a matroid
538. Core
539. Corona
540. Cospectral graphs
541. Cotree, co-tree
542. Countable graph
543. Counter automation
544. Coverability tree
545. Covering cycle
546. Covering graph
547. Covering set of vertices
548. Covering vertex set
549. Critical edge
550. Critical graph
551. Critical kernel-imperfect digraph
552. Critical pair
553. Critical path
554. Critical path method
555. Critical set
556. Critical tournament
557. Critical vertex
558. Criticality index
559. Critically k-connected graph
560. Cross
561. Cross-adjacent edges
562. Cross-chromatic index
563. Cross-free coloring
564. Cross-free matching
565. Cross-free matching number
566. Cross arc
567. Cross product
568. Crossing number
569. Crown
570. Crown of graphs
571. Cubic graph
572. Cubical graph
573. Cut-edge
574. Cut of a layout
575. Cutpoint
576. Cutpoint graph
577. Cutset
578. Cutset matrix
579. Cutset matroid
580. Cutting set
581. Cutting vertex
582. Cutvertex
583. Cutwidth of a graph
584. Cutwidth of a layout
585. Cyclability
586. Cycle
587. Cycle-factor
588. Cycle basis
589. Cycle complementary
590. Cycle cover problem
591. Cycle embedding matrix
592. Cycle isomorphism
593. Cycle matrix
594. Cycle matroid
595. Cycle space
596. Cycle spectrum
597. Cycle vector
598. Cyclic alternating chain
599. Cyclic chromatic number
600. Cyclic edge
601. Cyclic edge connected vertices
602. Cyclic graph
603. Cyclic matroid
604. Cyclic sequence
605. Cyclic vector of a graph
606. Cyclomatic complexity of a program
607. Cyclomatic matrix
608. Cyclomatic number
609. D-Decomposition
610. D-Dimensional c-ary array
611. D-Dimensional c-ary clique
612. D-Dimensional lattice
613. D-Regular tree with boundary
614. D-improper list chromatic number
615. DAG
616. DAG (Directed Acyclic Graph)
617. DFS
618. DFS-tree
619. Dag for basic block
620. Dag of control flow graph
621. Data dependence
622. Data dependence graph
623. Data flow analysis frameworks
624. Data flow analysis problem
625. Data set
626. Data term
627. De Bruijn graph
628. De Bruijn undirected graph
629. Decay number
630. Decidable problem
631. Decision problem
632. Decision problem DIMk
633. Decision tree
634. Decomposable graph
635. Decomposable hammock
636. Decomposable tournament
637. Decomposition
638. Decomposition dimension
639. Defect n-extendable graph
640. Deficiency
641. Deficiency of a bipartite graph
642. Deficiency of a graph
643. Defining set
644. Degenerate tree
645. Degree balanced digraph
646. Degree of a graph
647. Degree of a graph group
648. Degree of a hypergraph edge
649. Degree of a vertex
650. Degree of an edge
651. Degree pair of a vertex
652. Degree sequence
653. Dense tree
654. Density
655. Dependent set of a matroid
656. Depth-first search (DFS)
657. Depth-first search tree
658. Depth-first spanning forest
659. Depth-first spanning tree
660. Depth of a DAG
661. Depth of a flow graph
662. Depth of a numbering
663. Depth of a tree
664. Depth of a vertex
665. Depth of an arrangeable graph
666. Depth of an arrangement
667. Derivation
668. Derivation tree
669. Derived graph
670. Derived sequence
671. Descendance graph
672. Descendant
673. Descendant of a vertex
674. Descendent of a vertex
675. Deterministic Turing machine
676. Deterministic automaton
677. Deterministic pushdown automaton
678. Determinization theorem
679. Detour
680. Detour center
681. Detour diameter
682. Detour distance
683. Detour dominating set
684. Detour eccentricity
685. Detour order
686. Detour periphery
687. Detour radius
688. Diagonal of a block
689. Diameter
690. Diametral chain
691. Diamond
692. Difference digraph
693. Difference of graphs
694. Differential of a graph
695. Differential of a set
696. Digraph
697. Dijkstra's algorithm
698. Dimension of a poset
699. Dinitz's algorithm
700. Direct product
701. Direct search
702. Directable graph
703. Directed acyclic graph
704. Directed edge
705. Directed forest
706. Directed graph
707. Directed hypergraph
708. Directed hyperpath
709. Directed hypertree
710. Directed multigraph
711. Directed sequence
712. Directed tree
713. Diregular digraph
714. Dirichlet eigenvalue problem
715. Disc
716. Disconnected graph
717. Discrete matroid
718. Disjunct union of graphs
719. Dismantlable graph
720. Dismantling enumeration
721. Dismantling order
722. Disorientation of an arc
723. Dissection
724. Distance
725. Distance-hereditary graph
726. Distance-transitive graph
727. Distance between two vertices
728. Distributed systems
729. Ditree
730. Divider
731. Domatic number
732. Domatic partition
733. Domatically full graph
734. Dominance number
735. Dominant-covering graph
736. Dominant-matching graph
737. Dominant set
738. Dominating cycle
739. Dominating function
740. Dominating graph
741. Dominating path
742. Dominating set
743. Dominating vertex
744. Dominating walk
745. Domination graph
746. Domination graph (of a tournament)
747. Domination number
748. Domination number relative to v
749. Domination perfect graph
750. Domination subdivision number
751. Dominator
752. Dominator tree
753. Domino
754. Domsaturation number
755. Double competition number
756. Double dominating set
757. Double domination number
758. Double edge dominating set
759. Double edge domination number
760. Double ray
761. Double rotation
762. Double star
763. Doubly chordal graph
764. Doubly perfect ordering
765. Doubly regular tournament
766. Doubly simplicial vertex
767. Doubly stochastic matrix
768. Drawing of graph
769. Dual graph
770. Dual hypergraph
771. Dual hypertree
772. Dual map
773. Dual matroid
774. Dual tournament
775. Dually chordal graph
776. Dually compact closed class of graphs
777. Dudeney's round table problem
778. Dudeney set
779. E-Free grammar
780. E-Free сoncatenation closure
781. E-Правило
782. E k-Cordial graph
783. Eccentric graph
784. Eccentric sequence
785. Eccentricity of a vertex
786. Economy region
787. Edge
788. Edge-cordial graph
789. Edge-cordial labeling
790. Edge-cover
791. Edge-critical graph
792. Edge-degree
793. Edge-forwarding index
794. Edge-graceful graph
795. Edge-graceful labeling
796. Edge-independent number
797. Edge-integrity
798. Edge-isoperimetric problem
799. Edge-labeling
800. Edge-magic total graph
801. Edge-magic total labeling
802. Edge-ordering
803. Edge-pancyclic graph
804. Edge-pancyclicity
805. Edge-ranking of a graph
806. Edge-superconnectivity
807. Edge adding
808. Edge chromatic number
809. Edge clique cover
810. Edge clique cover number
811. Edge colourable graph
812. Edge connectivity
813. Edge connectivity number
814. Edge core
815. Edge covering
816. Edge critical graph
817. Edge cut, edge cut set
818. Edge density
819. Edge dominating set
820. Edge domination number
821. Edge graph
822. Edge group of a graph
823. Edge incidency matrix
824. Edge isomorphic graphs
825. Edge k-colourable graph
826. Edge k-colouring
827. Edge kernel
828. Edge list
829. Edge monochromatic class
830. Edge of a hypergraph
831. Edge of attachment
832. Edge path cover
833. Edge path number
834. Edge ranking number
835. Edge reconstructibility
836. Edge regular graph
837. Edge space
838. Edge symmetric graph
839. Edge t-ranking
840. Effectively solvable problem
841. Efficient dominating set
842. Eigenvalue of a graph
843. Element of a graph
844. Elementary Petri net
845. Elementary homomorphism
846. Embedding of a graph
847. Emptiness problem
848. Empty deadend
849. Empty deadlok
850. Empty graph
851. Empty hypergraph
852. Empty loop
853. Empty marking problem
854. Empty problem
855. Empty string
856. Empty subgraph
857. Empty symbol
858. Empty tree
859. Enabled transition
860. Enclosure transition
861. End-edge
862. End-vertex
863. Endblock
864. Endline graph
865. Endomorphism
866. Endpoint, end-vertex
867. Endpoints of a path (chain)
868. Energy of graph
869. Entire choice number
870. Entire chromatic number
871. Entire colouring
872. Entry
873. Entry node of a fragment
874. Entry vertex
875. Entry vertex of a subgraph
876. Environment of a vertex
877. Equally coloured vertices
878. Equiseparable trees
879. Equistable graph
880. Equitable partition
881. Equivalence of languages problem
882. Equivalence problem
883. Equivalence relation
884. Equivalent cycles
885. Equivalent derivations
886. Equivalent grammars
887. Equivalent program schemata
888. Equivalent programs
889. Erdos--Gallai criterion
890. Essential arc
891. Essential independent set
892. Euler's formula
893. Euler graph
894. Eulerian chain
895. Eulerian circuit
896. Eulerian cycle
897. Eulerian digraph
898. Eulerian graph
899. Eulerian tour
900. Eulerian trail
901. Evaluated graph
902. Evaluation of a graph
903. Even component
904. Even contractile graph
905. Even graph
906. Even pair
907. Event
908. Event-condition system
909. Event condition
910. Event realization
911. Exact double dominating set
912. Exact n-step dominating set
913. Exact n-step domination graph
914. Exceptional graph
915. Exclusion operation
916. Execution of Petri net
917. Execution of large-block schema
918. Execution sequence
919. Exhaustive search
920. Exit
921. Exit node of a fragment
922. Exponent of a digraph
923. Expression DAG
924. Expression dag
925. Extended odd graph
926. Extended regular expression
927. Exterior face
928. Exterior of a cycle
929. External input place
930. External output place
931. External place
932. External stability set
933. External vertex
934. F-Arc
935. F-Direct arc
936. F-Dominating cycle
937. F-Factor
938. F-Heap
939. F-Inverse arc
940. F-Line
941. F-Matching width
942. F-Orthogonal subgraph
943. F-Path
944. F-Rank
945. F-Ray
946. F-Reachable (from p) node
947. F-Region
948. F-Stability number
949. F-Stable set
950. F-Width (of a hypergraph)
951. F-Достижимость
952. F-Дуга
953. F-Линия
954. F-Луч
955. F-Область
956. F-Прямая дуга
957. F-Путь
958. F-Ранг
959. F-Фактор
960. FAS-problem
961. FVS-problem
962. Face
963. Facet
964. Facial cycle
965. Factor-cf-graph
966. Factor-control-flow-graph
967. Factor-critical graph
968. Factor-graph
969. Factorization
970. Factorization of a graph
971. Father of a vertex
972. Feedback arc set
973. Feedback vertex set
974. Fibonacci heap
975. Fibre
976. Filter
977. Final substring
978. Finish vertex
979. Finishing node of fragment
980. Finite-state automation
981. Finite automaton
982. Finite graph
983. Finite tree
984. Finiteness problem
985. First Order formula
986. Five-color theorem
987. Fixed vertex
988. Flag
989. Flat forest
990. Flow
991. Flow-diagram
992. Flow-equivalent graphs
993. Flow augmenting path
994. Flow control
995. Flow dependence
996. Flow graph
997. Flower
998. Forbidden subgraph
999. Forcing number
1000. Forcing set