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

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

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