The following pages link to (Q5799732):
Displayed 50 items.
- A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) (Q270266) (← links)
- Octants are cover-decomposable (Q411409) (← links)
- Menger's theorem for graphs containing no infinite paths (Q594106) (← links)
- Some undecidable termination problems for semi-Thue systems (Q673625) (← links)
- A total-chromatic number analogue of Plantholt's theorem (Q750449) (← links)
- The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small (Q752723) (← links)
- How colorful the signed graph? (Q759762) (← links)
- Term rank of \(0,1\) matrices (Q774036) (← links)
- Embedding an incomplete latin square in a latin square with a prescribed diagonal (Q796539) (← links)
- Upper bound for linear arboricity (Q809087) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- Super-nets and their hierarchy (Q1050114) (← links)
- Some sequences associated with combinatorial structures (Q1073032) (← links)
- Completing a matrix when certain entries of its inverse are specified (Q1075403) (← links)
- A theory for nondeterminism, parallelism, communication, and concurrency (Q1081296) (← links)
- Menger's theorem for countable graphs (Q1094433) (← links)
- Murky graphs (Q1101470) (← links)
- Embedding partial triple systems (Q1112041) (← links)
- The cover-index of infinite graphs (Q1137594) (← links)
- Structural aspects of controllability and observability. II: Digraph decomposition (Q1142739) (← links)
- Planarity and duality of finite and infinite graphs (Q1142781) (← links)
- On the total correctness of nondeterministic programs (Q1143163) (← links)
- Embedding incomplete Latin squares in Latin squares whose diagonal is almost completely prescribed (Q1143396) (← links)
- Subgraphs and their degree sequences of a digraph (Q1148915) (← links)
- On hamiltonian circuits in Cayley diagrams (Q1159212) (← links)
- Generalized latin rectangles. II: Embedding (Q1160182) (← links)
- The total chromatic number of nearly complete bipartite graphs (Q1179463) (← links)
- Infinite matching theory (Q1191911) (← links)
- The age of a relational structure (Q1191913) (← links)
- Julius Petersen's theory of regular graphs (Q1198642) (← links)
- Covers, matchings and odd cycles of a graph (Q1219306) (← links)
- Proving containment of bounded AFL (Q1230665) (← links)
- Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen (Q1233877) (← links)
- Value-true walks in finite, connected, valuated graphs (Q1237989) (← links)
- On the equivalence of Mealy-type and Moore-type automata and a relation between reducibility and Moore-reducibility (Q1239135) (← links)
- The concepts of irreducibility and full indecomposability of a matrix in the works of Frobenius, König and Markov (Q1241552) (← links)
- Combinatorial aspects of rectangular non-negative matrices (Q1245964) (← links)
- Two classes of \(q\)-ary codes based on group divisible association schemes (Q1296993) (← links)
- The total chromatic number of regular graphs whose complement is bipartite (Q1318798) (← links)
- A vertex-splitting lemma, de Werra's theorem and improper list colourings (Q1366607) (← links)
- The bases of weighted graphs (Q1377737) (← links)
- An optimization of Seidenberg's elimination algorithm in differential algebra. (Q1565826) (← links)
- An algorithm for prescribed multiple domination in arbitrary graphs (Q1608446) (← links)
- Online dominating set (Q1741855) (← links)
- Terminable and interminable paths and trails in infinite graphs (Q1845741) (← links)
- Irregular embeddings of multigraphs with fixed chromatic number (Q1901051) (← links)
- Cubic graphs that cannot be covered with four perfect matchings (Q2040017) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- Infinite behaviour of Petri nets (Q2265817) (← links)