Страницы-сироты

На следующие страницы нет ссылок с других страниц WikiGrapp, и они не включаются в другие страницы.

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

551. Incidence relation
552. Inclusion of languages problem
553. Inclusion of schemas
554. Inclusion tree
555. Increment operator
556. Indecomposable tournament
557. Indegree, in-degree
558. Independence graph of a graph
559. Independence polynomial
560. Independence subdivision number
561. Independent F-matching width
562. Independent F-width
563. Independent dominating number
564. Independent dominating set
565. Independent domination number relative to v
566. Independent matching width
567. Independent n-domination number
568. Independent paths
569. Independent width
570. Indirect addressing graph
571. Induced matching partition number
572. Induced path number
573. Inflation
574. Information flow
575. Informationally connected operands
576. Informationally incompatible operands
577. Inheritance graph
578. Inheritance relation
579. Inhibitor Petri net
580. Inhibitor arc
581. Initial state
582. Initial string
583. Initial symbol
584. Input place
585. Inset
586. Integer distance graph
587. Integral graph
588. Integrity
589. Internal transition
590. Interpretation
591. Interval I(u,v)
592. Interval chromatic number
593. Interval coloring
594. Interval of a tournament
595. Inverse relation
596. Irreducible additive hereditary graph property
597. Irredundance number
598. Irredundance perfect graph
599. Irredundant Petri net
600. Irregular digraph
601. Irregular graph
602. Irregularity of a digraph
603. Irregularity strength
604. Isolated vertex subset
605. Isomorphic decomposition
606. Isomorphic posets
607. Isospectral graphs
608. Isotropic coloring
609. Iteration operation
610. Join operation
611. Jump distance
612. Jump graph
613. K-Binding number
614. K-Bounded Petri net
615. K-Case term
616. K-Choosable graph
617. K-Chorded bigraph
618. K-Closure of a graph
619. K-Cocomparability ordering
620. K-Cover of a (hyper)graph
621. K-Cyclable graph
622. K-Cyclic chromatic number
623. K-Cyclic coloring
624. K-Diameter
625. K-Dimensional poset
626. K-Distance
627. K-Dominating cycle
628. K-Edge-connected graph
629. K-Equitable graph
630. K-Equitable labeling
631. K-Factorable graph
632. K-Game-colorable graph
633. K-Irredundance perfect graph
634. K-Iterated line digraph
635. K-Jump graph
636. K-Matching
637. K-Minus-critical graph
638. K-Ordered Hamiltonian graph
639. K-Outerplanar graph
640. K-Outpath
641. K-Pan
642. K-Path graph
643. K-Placement
644. K-Ranking
645. K-Recognizer
646. K-Restricted total domination number
647. K-Sequentially additive graph
648. K-Sequentially additive labeling
649. K-Snark
650. K-Stability
651. K-Sun
652. K-Walk
653. K-Wide diameter
654. K-Wide distance
655. K-covering cycle
656. K-path
657. K-reconstructible graph
658. K-reconstruction of a graph
659. K-restricted domination number
660. K-th Neighborhood of a vertex
661. K-th Power of a graph
662. K-γ-Critical graph
663. K-Кратная конкатенация цепочек
664. K-Отделимость
665. K-Поток
666. K-Пучково-изоморфные графы
667. K-Реберно связный граф
668. K-Транзитивная группа графа
669. KP-орграф
670. K\"onigsberg's bridges problem
671. Karp-Miller tree
672. Kautz digraph
673. Kernel-perfect digraph
674. Kings graph
675. Kirchoff matrix
676. Kleene closure
677. Kleene star
678. Knödel graph
679. Krausz dimension of a graph
680. Krausz partition of a graph
681. Kronecker product
682. Kruskal's algorithm
683. Kuratowski's criterion
684. Kuratowski's theorem
685. L-Total coloring
686. L-Веер
687. L-Соединимость
688. L-Цикл
689. Labeled Petri net, Labelled Petri net
690. Labeled tree, Labelled tree
691. Labeling of type (a,b,c)
692. Ladder
693. Language
694. Laplacian eigenvalues
695. Laplacian spectral radius
696. Laplacian spectrum
697. Large-block program
698. Large-block program execution
699. Leaf density
700. Least upper bound
701. Left-sided balanced tree
702. Length of a circuit
703. Length of a hypercycle
704. Length of a path
705. Length of a string
706. Length of a vertex
707. Letter
708. Lexicographic product
709. Light edge
710. Light graph
711. Limit flow graph
712. Line
713. Line graph of a mixed graph
714. Linear NCE graph grammar
715. Linear arrangement
716. Linear bounded automaton
717. Linear extension of a poset
718. Linear forest
719. Linear hypergraph
720. Linear k-arboricity of a graph
721. Linear k-forest
722. Linear layout
723. Linear matroid
724. Linear order
725. Linear vertex arboricity
726. Liouville property of an operator on graphs
727. List coloring
728. List edge-coloring problem
729. List edge chromatic number
730. List homomorphism
731. List total coloring
732. List total coloring problem
733. List vertex-coloring problem
734. Live transition
735. Liveness problem
736. Local-edge-connectivity
737. Local exponent of digraph
738. Local independence number
739. Local input place
740. Local irregularity of a digraph
741. Local isomorphism
742. Local output place
743. Local place
744. Local tree-width
745. Locally k-connected graph
746. Locally longest with respect to M cycle
747. Locally semicomplete digraph
748. Locating-dominating set
749. Locating set
750. Location-domination number
751. Location number
752. Lower independence number
753. M-Choosable graph with impropriety d
754. M-Convex set in G
755. MAXIMUM FLOW problem
756. MAXIMUM INDEPENDENT SET problem
757. MIDS problem
758. MINIMUM FILL-IN problem
759. MINIMUM GRAPH COLORING problem
760. MINIMUM VERTEX COVER problem
761. Magic labeling
762. Magnet in a graph
763. Magnitude of a flow
764. Main eigenvalue
765. Majority dominating function
766. Majority domination number
767. Marked graph
768. Marked trap
769. Marker
770. Marking operation
771. Matching equivalent
772. Matching polynomial
773. Matching width
774. Matrix graph
775. Matroid connectivity
776. Matthews graph
777. Max-flow min-cut theorem
778. Maximal complete subgraph
779. Maximal dominating set
780. Maximal domination number
781. Maximal flow
782. Maximal independence number
783. Maximal packing
784. Maximal subnet
785. Maximally irregular graph
786. Maximum-cardinality matching
787. Maximum hyperflow problem
788. Maximum matching graph
789. Maximum neighbour
790. Maximum neighbourhood ordering
791. Median generalized binary split tree
792. Median graph
793. Memory state
794. Menger's theorem
795. Metric-locating-dominating set
796. Metric-location-domination number
797. Metric dimension
798. Middle graph
799. Minimal dominating graph
800. Minimal imperfect graph
801. Minimal irredundance imperfect graph
802. Minimal separator
803. Minimal triangulation
804. Minimum cost hyperflow problem
805. Minimum gossip graph
806. Minimum independent dominating set problem
807. Minimum separator
808. Minimum t-spanner problem
809. Minor-closed class of graphs
810. Minus dominating function
811. Minus domination number
812. Mode
813. Mode vertex
814. Monadic Second Order formula
815. Monge graph
816. Monotonicity property
817. Mu-Excellent graph
818. Multiple domination
819. Multiplicity
820. Multiplicity of a covering
821. Multiplicity of an edge
822. Multiway tree
823. Mutually eccentric vertices
824. Mutually graceful trees
825. N-Dominating set
826. N-Domination number
827. N-Folded Petersen graph
828. N-Independence number
829. N-Independent set
830. N-Iterated line graph
831. N-Unavoidable graph
832. N-Складной граф Петерсена
833. N-Фактор графа
834. N-Факторизуемый граф
835. NP-Complete language
836. NP-Hard language
837. NP-Hard problem
838. Naked vertex
839. Near perfect matching
840. Nearest common ancestor
841. Nearest common dominator
842. Neighbour transition
843. Nested set of alts
844. Nested set of zones
845. Net formula
846. Non-edge
847. Noncovered vertex
848. Nondecidable problem
849. Nondeterministic finite automaton
850. Nonstrong argument
851. Nonstrong input
852. Nonstrong output
853. Nonstrong result
854. Nonterminal alphabet
855. Nonterminal symbol
856. Normal approximate (point) spectrum
857. Normally symmetric graph
858. Normed weighted graph
859. Null graph
860. Number of noncongruence of a numbering
861. ODC
862. Oberwolfach problem
863. Oblique graph
864. Obstruction set
865. Occurence (of a graph H in G)
866. Occurrence process net
867. Odd-signable graph
868. Odd-signed graph
869. One-sided balanced tree
870. One-way infinite path
871. One-way pushdown automaton
872. Open neighbourhood
873. Operation
874. Operation of a Petri net
875. Operation of formation of a set of merged places
876. Operation of merging of places
877. Operator
878. Optimal 1-edge hamiltonian graph
879. Optimal 1-hamiltonian graph
880. Optimal 1-node hamiltonian graph
881. Order of a tree
882. Ordered labelled tree
883. Ordinary Petri net
884. Orientation distance graph
885. Orientation number
886. Oriented edge
887. Orthogonal (g,f)-factorization
888. Orthogonal double cover
889. Oscillation of a graph
890. Out-neighbourhood
891. Out-semicomplete digraph
892. Out-tree
893. Outdegree, out-degree
894. Outdegree matrix
895. Outpath
896. Output dependence
897. Output node of fragment
898. Output place
899. Outset
900. P-Competition graph
901. P-Critical graph
902. P-Language
903. P-well-covered graph
904. P4-Связный граф
905. P=NP problem, P versus NP problem
906. PRAM
907. P 4-Isomorphic graphs
908. P 4-Reduced graph
909. P 4-Reducible graph
910. P 4-Sparse graph
911. P and NP Classes
912. Paired-dominating set
913. Paired-domination number
914. Pan-bicentral graph
915. Pan-unicentral graph
916. Pancentral graph
917. Panpropositionable Hamiltonian graph
918. Parikh mapping
919. Parse tree
920. Partial-edge separator
921. Partial graph morphism
922. Partial hypergraph
923. Partial k-path
924. Partial signed domination number
925. Partially decidable problem
926. Partially ordered set
927. Partially square graph
928. Partition of a set
929. Passive state of compound transition
930. Path-Hamiltonian edge
931. Path-decomposition
932. Path coloring
933. Path layer matrix
934. Path pile
935. Path pile number
936. Pathwidth of a graph
937. Pebbling number
938. Perfect fractional matching
939. Perfect graph theorem
940. Perfect k-matching
941. Perfect one-factorization
942. Period
943. Periodicity of a graph
944. Periphery
945. Persistence problem
946. Persistent Petri net
947. Persistent transition
948. Petal of a flower
949. Petersen graph
950. Petersen hypernet
951. Petri graph
952. Petri net with place capacities
953. Petri net with priorities
954. Petri net with waiting
955. Pfafian orientation of a graph
956. Phrase-structure grammar
957. Phylogeny digraph
958. Phylogeny graph
959. Phylogeny number
960. Place
961. Planar embedding of a graph
962. Planar triangulation
963. Planarity criteria
964. Point-tree hypergraph
965. Point spectrum
966. Polar graph
967. Polygonal tree
968. Polyhedral graph
969. Polyhedron graph
970. Polynomial algorithm
971. Polynomial expression of the stability function
972. Polynomial graph inclusion problem
973. Polynomial transformation
974. Polytop graph
975. Pontrjagin-Kuratowski's criterion
976. Poset
977. Post-condition
978. Postdominator tree
979. Potential liveness of transitions problem
980. Potentially dead transition
981. Potentially live transition
982. Pre-condition
983. Predicate term
984. Prefix
985. Prefix graph
986. Prefix tree
987. Prependant vertex
988. Prescribed chromatic number
989. Prime graph
990. Prime hammock
991. Prime labeling
992. Primitive Petri net
993. Primitive cycle
994. Primitive net formula
995. Print operator
996. Priority
997. Private neighbor set
998. Private neighbour
999. Private neighbourhood
1000. Problem
1001. Problem size
1002. Process
1003. Process net
1004. Process net with competition
1005. Product of two languages
1006. Production
1007. Production grammar
1008. Profile numbering
1009. Profile of a graph
1010. Profile of numbering
1011. Profile width of a vertex
1012. Program of automaton
1013. Proper dominator
1014. Proper labeling
1015. Proper substring
1016. Provable problem
1017. Pseudo-h-hamiltonian cycle
1018. Pseudo-h-hamiltonian graph
1019. Pseudo-hamiltonian graph
1020. Pseudo-hamiltonicity number
1021. Pseudo-polynomial algorithm
1022. Pseudo-product
1023. Pseudo-wheel
1024. Pseudograceful graph
1025. Pseudosimilar vertices
1026. Pumping lemmas
1027. Pushdown automaton
1028. Q-Периферийная вершина
1029. Quadrilateral
1030. Quadtree
1031. Quasi-bipartite mixed graph
1032. Quasi-diameter
1033. Quasi-radius
1034. Quasi-transitive tournament
1035. R-Circular colorable graph
1036. R-Identifying code
1037. Radial path
1038. Radius-essential edge
1039. Ramanujan graph
1040. Ramsey graph game
1041. Rank of a hypergraph
1042. Ranking number
1043. Reach-preservable graph
1044. Reach-preserving vertex
1045. Reachability graph
1046. Reachability problem
1047. Reachable (from a) vertex
1048. Realizer of P
1049. Receiver
1050. Recognizer