Тупиковые страницы

Следующие страницы не содержат ссылок на другие страницы в этой вики.

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

501. H-Saturated graph
502. H-Tree
503. H-Uniform hypergraph
504. H-decomposition number
505. H-distance
506. H-forming number
507. H-forming set
508. H-path
509. H-tuple domination
510. HB-Tree
511. HHD-free graph
512. HS-Tree
513. Halin graph
514. Hamiltonian center
515. Hamiltonian chain
516. Hamiltonian circuit
517. Hamiltonian connected graph
518. Hamiltonian cycle
519. Hamiltonian decomposable graph
520. Hamiltonian digraph
521. Hamiltonian graph
522. Hamiltonian path
523. Hamming distance
524. Hamming graph
525. Hammock presentation
526. Handshake's lemma
527. Harmonious chromatic number
528. Head of a hyperarc
529. Head place
530. Heap-ordered tree
531. Heap order
532. Height of a branch of a tree
533. Height of a tree
534. Height of a vertex
535. Helly hypergraph
536. Hereditary class of graphs
537. Hereditary dually chordal graph
538. Hereditary property of a graph
539. Hierarchical Petri net
540. Hierarchical graph
541. Hierarchy of embedded alts
542. Hierarchy of embedded zones
543. High-level Petri nets
544. Hilbert's problem
545. Hole
546. Homeomorphical graphs
547. Homeomorphically irreducible tree
548. Homogeneously embedded graph
549. Homomorphic image of a graph
550. Homomorphism of a graph
551. Honest graph
552. House
553. Hungarian method
554. Hyper Petersen graph
555. Hyper de Bruijn graph
556. Hyperarc
557. Hypercube
558. Hypercycle
559. Hypergraph
560. Hypertree
561. Hypohamiltonian graph
562. I-Tree
563. Identical group of a graph
564. Immediate dominator
565. Immediate postdominator
566. Immersion
567. Immovable vertex
568. Impropriety
569. In-neighborhood
570. In-semicomplete digraph
571. In-tree
572. Incenter
573. Incidence function labelling
574. Incidence graph
575. Incidence matrix
576. Incidence relation
577. Inclusion of languages problem
578. Inclusion of schemas
579. Inclusion tree
580. Incomparable vertices
581. Incompatibility graph
582. Increment operator
583. Indecomposable tournament
584. Indegree, in-degree
585. Indegree matrix
586. Independence graph of a graph
587. Independence number
588. Independence polynomial
589. Independence subdivision number
590. Independent F-matching width
591. Independent F-width
592. Independent circuits
593. Independent dominating number
594. Independent dominating set
595. Independent domination number relative to v
596. Independent edges
597. Independent matching width
598. Independent n-domination number
599. Independent paths
600. Independent set
601. Independent sets of a matroid
602. Independent vertex set of a hypergraph
603. Independent width
604. Index
605. Indifference digraph
606. Indifference graph
607. Indirect addressing graph
608. Induced (with vertices) subgraph
609. Induced matching partition number
610. Induced path number
611. Inductive graph
612. Infinite graph
613. Inflation
614. Information flow
615. Information graph
616. Informationally connected operands
617. Informationally incompatible operands
618. Inheritance graph
619. Inheritance relation
620. Inhibitor Petri net
621. Inhibitor arc
622. Initial node
623. Initial state
624. Initial string
625. Initial symbol
626. Inorder traversal
627. Input arc
628. Input directed spanning tree
629. Input place
630. Input tree
631. Inradius
632. Inseparation number
633. Inset
634. Integer distance graph
635. Integral graph
636. Integrity
637. Internal transition
638. Interpretation
639. Intersection graph
640. Intersection number
641. Intersection of graphs
642. Interval I(u,v)
643. Interval chromatic number
644. Interval coloring
645. Interval function
646. Interval graph
647. Interval hypergraph
648. Interval of a graph
649. Interval of a tournament
650. Interval order
651. Intractable problem
652. Invariant of a graph
653. Inverse arborescence
654. Inverse cycle
655. Inverse relation
656. Irreducible additive hereditary graph property
657. Irreducible graph
658. Irredundance number
659. Irredundance perfect graph
660. Irredundant Petri net
661. Irredundant set
662. Irreflexive relation
663. Irregular digraph
664. Irregular graph
665. Irregularity of a digraph
666. Irregularity strength
667. Isolated vertex
668. Isolated vertex of a hypergraph
669. Isolated vertex subset
670. Isometric subgraph
671. Isomorphic decomposition
672. Isomorphic directed graphs
673. Isomorphic embedding problem
674. Isomorphic labeled graphs
675. Isomorphic matroids
676. Isomorphic posets
677. Isomorphism problem
678. Isoperimetric number
679. Isospectral graphs
680. Isotropic coloring
681. Iterated clique graph
682. Iteration operation
683. J-Pancyclic graph
684. Join of graphs
685. Join operation
686. Joined vertices
687. Jump distance
688. Jump graph
689. Justified tree
690. K-Diameter
691. K-Dimensional poset
692. K-Distance
693. K-Divergent graph
694. K-Dominating cycle
695. K-Edge-connected graph
696. K-Edge connected graph
697. K-Equitable graph
698. K-Equitable labeling
699. K-Factor of a graph
700. K-Factorable graph
701. K-Factorizable graph
702. K-Flow
703. K-Game-colorable graph
704. K-Irredundance perfect graph
705. K-Iterated line digraph
706. K-Jump graph
707. K-Matching
708. K-Minus-critical graph
709. K-Null graph
710. K-Numbering
711. K-Ordered Hamiltonian graph
712. K-Outerplanar graph
713. K-Outpath
714. K-Pan
715. K-Partite graph
716. K-Path graph
717. K-Placement
718. K-Ranking
719. K-Recognizer
720. K-Restricted total domination number
721. K-Saturated graph
722. K-Separability
723. K-Sequentially additive graph
724. K-Sequentially additive labeling
725. K-Snark
726. K-Stability
727. K-Sun
728. K-Transitive graph
729. K-Transitive group of a graph
730. K-Tree
731. K-Tree with small height
732. K-Unitransitive graph
733. K-Walk
734. K-Wide diameter
735. K-Wide distance
736. K-covering cycle
737. K-d-Tree
738. K-invariant graph
739. K-path
740. K-reconstructible graph
741. K-reconstruction of a graph
742. K-restricted domination number
743. K-th Neighborhood of a vertex
744. K-th Power of a graph
745. KB-Tree
746. K\"onigsberg's bridges problem
747. Karp-Miller tree
748. Kautz digraph
749. Kernel
750. Kernel-perfect digraph
751. Keyed access method
752. Kings graph
753. Kirchoff matrix
754. Kleene closure
755. Kleene star
756. Knot graph
757. Krausz dimension of a graph
758. Krausz partition of a graph
759. Kronecker product
760. Kuratowski's criterion
761. Kuratowski's theorem
762. L-Fan
763. L-Geodetic graph
764. L-Joinability
765. L-Loop
766. L-Numbering
767. L-Total coloring
768. Label
769. Labeled graph, labelled graph
770. Labeled tree, Labelled tree
771. Labeling
772. Labeling of type (a,b,c)
773. Ladder
774. Language
775. Laplacian eigenvalues
776. Laplacian matrix
777. Laplacian spectral radius
778. Laplacian spectrum
779. Large-block program
780. Large-block program execution
781. Large-block program schemata
782. Large-block schema
783. Lavrov schemata
784. Layout
785. Leaf
786. Leaf density
787. Least upper bound
788. Lee scheme
789. Left-derivation tree
790. Left-sided balanced tree
791. Left linear tree
792. Leftmost derivation
793. Length of a chain
794. Length of a circuit
795. Length of a cycle
796. Length of a hypercycle
797. Length of a path
798. Length of a string
799. Length of a vertex
800. Length of an arc
801. Letter
802. Level representation of rooted trees
803. Lexicographic order
804. Lexicographic product
805. Light edge
806. Light graph
807. Limit flow graph
808. Line
809. Line-chromatic number
810. Line-covering number
811. Line-independence number
812. Line-symmetric graph
813. Line covering
814. Line digraph
815. Line graph
816. Line graph of a hypergraph
817. Line graph of a mixed graph
818. Line group of a graph
819. Line incident with a vertex
820. Linear-bounded automation
821. Linear NCE graph grammar
822. Linear arrangement
823. Linear bounded automaton
824. Linear component
825. Linear extension of a poset
826. Linear forest
827. Linear hypergraph
828. Linear k-arboricity of a graph
829. Linear k-forest
830. Linear layout
831. Linear matroid
832. Linear order
833. Linear scheme (code, presentation)
834. Linear subgraph of a directed graph
835. Linear subgraph of a graph
836. Linear tree
837. Linear vertex arboricity
838. Liouville property of an operator on graphs
839. List assignment
840. List chromatic number
841. List coloring
842. List edge-coloring problem
843. List edge chromatic number
844. List homomorphism
845. List total coloring
846. List total coloring problem
847. List vertex-coloring problem
848. Liveness problem
849. Local-edge-connectivity
850. Local computation on graphs
851. Local exponent of digraph
852. Local independence number
853. Local input place
854. Local irregularity of a digraph
855. Local isomorphism
856. Local output place
857. Local place
858. Local replacement method
859. Local tree-width
860. Locally countable graph
861. Locally finite graph
862. Locally k-connected graph
863. Locally longest with respect to M cycle
864. Locally restricted graph
865. Locally semicomplete digraph
866. Locating-dominating set
867. Locating set
868. Location-domination number
869. Location number
870. Logic for expressing graph properties
871. Loop
872. Loop of matroid
873. Loop region
874. Lower independence number
875. M-Convexity number
876. M-Numbering
877. MAXIMUM FLOW problem
878. MAXIMUM INDEPENDENT SET problem
879. MIDS problem
880. MINIMUM FILL-IN problem
881. MINIMUM GRAPH COLORING problem
882. MINIMUM VERTEX COVER problem
883. Magic labeling
884. Magnet in a graph
885. Magnitude of a flow
886. Main eigenvalue
887. Majority dominating function
888. Majority domination number
889. Map
890. Mark
891. Marked graph
892. Marked trap
893. Marker
894. Marking
895. Marking operation
896. Marriage problem
897. Martynyuk schemata
898. Matching
899. Matching equivalent
900. Matching number
901. Matching polynomial
902. Matching width
903. Matrix-tree theorem
904. Matrix graph
905. Matrix matroid
906. Matroid
907. Matroid cocycle space
908. Matroid connectivity
909. Matroid cycle space
910. Matthews graph
911. Max-flow min-cut theorem
912. Maxclique
913. Maximal complete subgraph
914. Maximal dominating set
915. Maximal domination number
916. Maximal exclusion graph
917. Maximal flow
918. Maximal independence number
919. Maximal packing
920. Maximal singular graph
921. Maximal strongly singular graph
922. Maximal subnet
923. Maximal tree
924. Maximally irregular graph
925. Maximum-cardinality matching
926. Maximum edge-connected graph
927. Maximum hyperflow problem
928. Maximum matching graph
929. Maximum neighbour
930. Maximum neighbourhood ordering
931. Maximum point-connected graph
932. McGee graph
933. Mean diameter
934. Median generalized binary split tree
935. Median graph
936. Median split tree
937. Membership problem
938. Memory state
939. Menger's theorem
940. Mergeable heap
941. Metric-locating-dominating set
942. Metric-location-domination number
943. Metric dimension
944. Middle graph
945. Minimal connected graph
946. Minimal dominating graph
947. Minimal flow
948. Minimal imperfect graph
949. Minimal irredundance imperfect graph
950. Minimal separator
951. Minimal triangulation
952. Minimum broadcast graph
953. Minimum cost hyperflow problem
954. Minimum gossip graph
955. Minimum independent dominating set problem
956. Minimum separator
957. Minimum t-spanner problem
958. Minor-closed class of graphs
959. Minor of a graph
960. Minsky machine
961. Minus dominating function
962. Minus domination number
963. Mixed graph
964. Mode
965. Mode vertex
966. Model of computation
967. Module of a graph
968. Monadic Second Order formula
969. Monge graph
970. Monochromatic class (set)
971. Monotone transitive graph
972. Monotonicity property
973. Mu-Excellent graph
974. Multi-coloring
975. Multicrown
976. Multidimensional B-tree
977. Multidimensional search tree
978. Multientry zone
979. Multigraph
980. Multigraph of strength s
981. Multiple arcs
982. Multiple domination
983. Multiple edges
984. Multiplicity
985. Multiplicity of a covering
986. Multiplicity of an edge
987. Multiway tree
988. Mutual matchings
989. Mutually connected vertices
990. Mutually eccentric vertices
991. Mutually graceful trees
992. N-Dominating set
993. N-Domination number
994. N-Extendable graph
995. N-Factorization of a graph
996. N-Folded Petersen graph
997. N-Independence number
998. N-Independent set
999. N-Iterated line graph
1000. N-Numbering