Некатегоризованные страницы

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

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