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

Ниже показано до 250 результатов в диапазоне от 521 до 770.

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