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

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

1551. Locating-dominating set
1552. Locating set
1553. Location-domination number
1554. Location number
1555. Logic for expressing graph properties
1556. Loop
1557. Loop of matroid
1558. Loop region
1559. Lower independence number
1560. M-Ary tree
1561. M-Choosable graph with impropriety d
1562. M-Convex set in G
1563. M-Convexity number
1564. M-Numbering
1565. M-Нумерация
1566. MAXIMUM FLOW problem
1567. MAXIMUM INDEPENDENT SET problem
1568. MIDS problem
1569. MINIMUM FILL-IN problem
1570. MINIMUM GRAPH COLORING problem
1571. MINIMUM VERTEX COVER problem
1572. Magic labeling
1573. Magnet in a graph
1574. Magnitude of a flow
1575. Main eigenvalue
1576. Majority dominating function
1577. Majority domination number
1578. Map
1579. Mark
1580. Marked graph
1581. Marked trap
1582. Marker
1583. Marking
1584. Marking operation
1585. Marriage problem
1586. Martynyuk schemata
1587. Matching
1588. Matching equivalent
1589. Matching number
1590. Matching polynomial
1591. Matching width
1592. Matrix-tree theorem
1593. Matrix graph
1594. Matrix matroid
1595. Matroid
1596. Matroid cocycle space
1597. Matroid connectivity
1598. Matroid cycle space
1599. Matthews graph
1600. Max-flow min-cut theorem
1601. Maxclique
1602. Maximal complete subgraph
1603. Maximal dominating set
1604. Maximal domination number
1605. Maximal exclusion graph
1606. Maximal flow
1607. Maximal independence number
1608. Maximal packing
1609. Maximal singular graph
1610. Maximal strongly singular graph
1611. Maximal subnet
1612. Maximal tree
1613. Maximally irregular graph
1614. Maximum-cardinality matching
1615. Maximum edge-connected graph
1616. Maximum hyperflow problem
1617. Maximum matching graph
1618. Maximum neighbour
1619. Maximum neighbourhood ordering
1620. Maximum point-connected graph
1621. McGee graph
1622. Mean diameter
1623. Median generalized binary split tree
1624. Median graph
1625. Median split tree
1626. Membership problem
1627. Memory state
1628. Menger's theorem
1629. Mergeable heap
1630. Metric-locating-dominating set
1631. Metric-location-domination number
1632. Metric dimension
1633. Middle graph
1634. Minimal connected graph
1635. Minimal dominating graph
1636. Minimal flow
1637. Minimal imperfect graph
1638. Minimal irredundance imperfect graph
1639. Minimal separator
1640. Minimal triangulation
1641. Minimum broadcast graph
1642. Minimum cost hyperflow problem
1643. Minimum gossip graph
1644. Minimum independent dominating set problem
1645. Minimum separator
1646. Minimum t-spanner problem
1647. Minor-closed class of graphs
1648. Minor of a graph
1649. Minsky machine
1650. Minus dominating function
1651. Minus domination number
1652. Mixed graph
1653. Mode
1654. Mode vertex
1655. Model of computation
1656. Module of a graph
1657. Monadic Second Order formula
1658. Monge graph
1659. Monochromatic class (set)
1660. Monotone transitive graph
1661. Monotonicity property
1662. Mu-Excellent graph
1663. Multi-coloring
1664. Multicrown
1665. Multidimensional B-tree
1666. Multidimensional search tree
1667. Multientry zone
1668. Multigraph
1669. Multigraph of strength s
1670. Multiple arcs
1671. Multiple domination
1672. Multiple edges
1673. Multiplicity
1674. Multiplicity of a covering
1675. Multiplicity of an edge
1676. Multiway tree
1677. Mutual matchings
1678. Mutually connected vertices
1679. Mutually eccentric vertices
1680. Mutually graceful trees
1681. N-Chromatic number
1682. N-Cube graph
1683. N-Dimensional hypercube
1684. N-Dominating set
1685. N-Domination number
1686. N-Extendable graph
1687. N-Factorization of a graph
1688. N-Folded Petersen graph
1689. N-Independence number
1690. N-Independent set
1691. N-Iterated line graph
1692. N-Numbering
1693. N-Star graph
1694. N-Unavoidable graph
1695. N-mesh
1696. N-node
1697. N-Звездный граф
1698. N-Нумерация
1699. N-Расширяемый граф
1700. N-Складной граф Петерсена
1701. N-Фактор графа
1702. N-Факторизация
1703. N-Факторизуемый граф
1704. N-Хроматическое число
1705. NCE graph grammar
1706. NP-Complete language
1707. NP-Complete problem
1708. NP-Hard language
1709. NP-Hard problem
1710. NP-complete problem
1711. NP-Полная задача
1712. NP-Трудная задача
1713. Naked vertex
1714. Near perfect matching
1715. Nearest common ancestor
1716. Nearest common dominator
1717. Nearly regular graph
1718. Neighbour transition
1719. Neighbourhood matrix
1720. Neighbourhood of a vertex
1721. Neighbourhood tree
1722. Neighbouring vertices
1723. Nested set of alts
1724. Nested set of zones
1725. Net
1726. Net formula
1727. Network
1728. Node
1729. Node bisector
1730. Node listing
1731. Non-circular grammar
1732. Non-edge
1733. Non-interpreted schemata
1734. Non-separable graph
1735. Noncovered vertex
1736. Nondecidable problem
1737. Nondeterministic Turing machine
1738. Nondeterministic finite automaton
1739. Nondeterministic pushdown automaton
1740. Nonstrong argument
1741. Nonstrong input
1742. Nonstrong output
1743. Nonstrong result
1744. Nonterminal alphabet
1745. Nonterminal symbol
1746. Normal approximate (point) spectrum
1747. Normally symmetric graph
1748. Normed weighted graph
1749. Nowhere-zero k-flow
1750. Null graph
1751. Number of noncongruence of a numbering
1752. Numbering
1753. Numbering of cf-graph
1754. ODC
1755. Oberwolfach problem
1756. Oblique graph
1757. Obstruction set
1758. Occurence (of a graph H in G)
1759. Occurrence process net
1760. Odd-signable graph
1761. Odd-signed graph
1762. Odd component
1763. Odd component number
1764. Odd graph
1765. One-chromatic number
1766. One-sided balanced tree
1767. One-way infinite path
1768. One-way infinite sequence
1769. One-way pushdown automaton
1770. Open neighbourhood
1771. Open sequence
1772. Operation
1773. Operation of a Petri net
1774. Operation of formation of a set of merged places
1775. Operation of merging of places
1776. Operator
1777. Optimal 1-edge hamiltonian graph
1778. Optimal 1-hamiltonian graph
1779. Optimal 1-node hamiltonian graph
1780. Optimal numbering
1781. Optimal ordering for trees
1782. Order of a graph
1783. Order of a hypergraph
1784. Order of a tree
1785. Order of an automorphism group
1786. Order relation
1787. Ordered chromatic number
1788. Ordered coloring of vertices
1789. Ordered edge chromatic number
1790. Ordered graph
1791. Ordered labelled tree
1792. Ordered tree
1793. Ordinary Petri net
1794. Orientation distance graph
1795. Orientation number
1796. Orientation of a graph
1797. Oriented edge
1798. Oriented graph
1799. Oriented tree
1800. Orthogonal (g,f)-factorization
1801. Orthogonal double cover
1802. Oscillation of a graph
1803. Out-neighbourhood
1804. Out-semicomplete digraph
1805. Out-tree
1806. Outcenter
1807. Outcoming arc
1808. Outdegree, out-degree
1809. Outdegree matrix
1810. Outerplanar graph
1811. Outerplane graph
1812. Outpath
1813. Output
1814. Output dependence
1815. Output directed spanning tree
1816. Output node of fragment
1817. Output place
1818. Output tree
1819. Output vertex of subgraph
1820. Outradius
1821. Outseparation number
1822. Outset
1823. P-Center
1824. P-Competition graph
1825. P-Critical graph
1826. P-Language
1827. P-Radius
1828. P-well-covered graph
1829. P-Центр
1830. P4-Connected graph
1831. P4-Связный граф
1832. P=NP problem, P versus NP problem
1833. PRAM
1834. PSPACE-hard problem
1835. P 4-Isomorphic graphs
1836. P 4-Reduced graph
1837. P 4-Reducible graph
1838. P 4-Sparse graph
1839. P and NP Classes
1840. Pack of a graph
1841. Packing of graphs
1842. Pair of connectivities
1843. Paired-dominating set
1844. Paired-domination number
1845. Pan-bicentral graph
1846. Pan-unicentral graph
1847. Pancentral graph
1848. Pancyclic graph
1849. Panpropositionable Hamiltonian graph
1850. Parallel Random Access Machine (PRAM)
1851. Parikh mapping
1852. Parse tree
1853. Partial-edge separator
1854. Partial edge
1855. Partial graph morphism
1856. Partial hypergraph
1857. Partial k-path
1858. Partial k-tree
1859. Partial order relation
1860. Partial signed domination number
1861. Partially decidable problem
1862. Partially ordered set
1863. Partially square graph
1864. Partition of a graph
1865. Partition of a set
1866. Partitioning problem
1867. Passive state of compound transition
1868. Path
1869. Path-Hamiltonian edge
1870. Path-decomposition
1871. Path coloring
1872. Path covering
1873. Path layer matrix
1874. Path pile
1875. Path pile number
1876. Pathwidth of a graph
1877. Pebbling number
1878. Pendant edge
1879. Peninsula
1880. Perfect elimination graph
1881. Perfect elimination scheme
1882. Perfect fractional matching
1883. Perfect graph
1884. Perfect graph theorem
1885. Perfect k-matching
1886. Perfect matching
1887. Perfect one-factorization
1888. Perfect sequence
1889. Perfectly contractile graph
1890. Period
1891. Periodicity of a graph
1892. Peripheral vertex
1893. Periphery
1894. Permutation graph
1895. Persistence problem
1896. Persistent Petri net
1897. Persistent transition
1898. Petal of a flower
1899. Petersen graph
1900. Petersen hypernet
1901. Petri graph
1902. Petri net with place capacities
1903. Petri net with priorities
1904. Petri net with waiting
1905. Pfafian orientation of a graph
1906. Phrase-structure grammar
1907. Phylogeny digraph
1908. Phylogeny graph
1909. Phylogeny number
1910. Place
1911. Planar embedding of a graph
1912. Planar graph
1913. Planar matroid
1914. Planar tree
1915. Planar triangulation
1916. Planarity criteria
1917. Plane graph
1918. Plane map
1919. Plane numbering
1920. Plane triangulation
1921. Plex
1922. Point
1923. Point-covering number
1924. Point-tree hypergraph
1925. Point spectrum
1926. Polar graph
1927. Pole
1928. Polygonal tree
1929. Polyhedral graph
1930. Polyhedron graph
1931. Polynomial algorithm
1932. Polynomial expression of the stability function
1933. Polynomial graph inclusion problem
1934. Polynomial transformation
1935. Polytop graph
1936. Pontrjagin-Kuratowski's criterion
1937. Poset
1938. Position tree
1939. Post-condition
1940. Postdomination
1941. Postdominator
1942. Postdominator tree
1943. Potential liveness of transitions problem
1944. Potentially dead transition
1945. Potentially live transition
1946. Power-chordal graph
1947. Pre-condition
1948. Predecessor of a vertex
1949. Predicate term
1950. Prefix
1951. Prefix graph
1952. Prefix graph of width n
1953. Prefix language
1954. Prefix tree
1955. Preorder
1956. Prependant vertex
1957. Prescribed chromatic number
1958. Prime graph
1959. Prime hammock
1960. Prime labeling
1961. Primitive Petri net
1962. Primitive cycle
1963. Primitive directed graph
1964. Primitive net formula
1965. Print operator
1966. Priority
1967. Prism
1968. Private neighbor set
1969. Private neighbour
1970. Private neighbourhood
1971. Problem
1972. Problem of finite-state automaton minimization
1973. Problem size
1974. Process
1975. Process net
1976. Process net with competition
1977. Product of graphs
1978. Product of two languages
1979. Production
1980. Production grammar
1981. Profile numbering
1982. Profile of a graph
1983. Profile of numbering
1984. Profile width of a vertex
1985. Program
1986. Program dependence graph
1987. Program dependences
1988. Program equivalence
1989. Program of automaton
1990. Program optimization
1991. Program schemata
1992. Progressive bounded graph
1993. Progressive finite graph
1994. Proper (vertex) colouring
1995. Proper coloring
1996. Proper control flow graph
1997. Proper dominator
1998. Proper interval graph
1999. Proper labeling
2000. Proper matching
2001. Proper numbering
2002. Proper substring
2003. Provable problem
2004. Pruned tree
2005. Pseudo-h-hamiltonian cycle
2006. Pseudo-h-hamiltonian graph
2007. Pseudo-hamiltonian graph
2008. Pseudo-hamiltonicity number
2009. Pseudo-polynomial algorithm
2010. Pseudo-product
2011. Pseudo-wheel
2012. Pseudograceful graph
2013. Pseudograph
2014. Pseudosimilar vertices
2015. Pseudosymmetric digraph
2016. Pseudovertex
2017. Pumping lemmas
2018. Pure synthesized grammar
2019. Pushdown automaton
2020. Q-Peripheral vertex
2021. Q-Периферийная вершина
2022. Quad cycle
2023. Quadrilateral
2024. Quadtree
2025. Quasi-bipartite mixed graph
2026. Quasi-diameter
2027. Quasi-radius
2028. Quasi-transitive tournament
2029. Quasibipyramid
2030. Quasistrongly connected graph
2031. R-Circular colorable graph
2032. R-Dense tree
2033. R-Identifying code
2034. R-Плотное дерево
2035. RAM
2036. Radial path
2037. Radially critical graph
2038. Radius-essential edge
2039. Radius of a graph
2040. Ramanujan graph
2041. Ramsey edge number
2042. Ramsey graph game
2043. Ramsey number
2044. Random access machine
2045. Random graph
2046. Rank function
2047. Rank of a graph
2048. Rank of a graph group
2049. Rank of a hypergraph
2050. Rank of a matroid