The following pages link to (Q3818315):
Displaying 50 items.
- Containment of butterflies in networks constructed by the line digraph operation (Q290188) (← links)
- On the planarity of the \(k\)-zero-divisor hypergraphs (Q322007) (← links)
- Gracefully cultivating trees on a cycle (Q324938) (← links)
- On the adjacent vertex-distinguishing acyclic edge coloring of some graphs (Q453364) (← links)
- Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length (Q497372) (← links)
- The complexity of some acyclic improper colourings (Q533784) (← links)
- On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number (Q539861) (← links)
- Extending cycles in directed graphs (Q580359) (← links)
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- Some properties of graphs determined by edge zeta functions (Q624533) (← links)
- On partitional labelings of graphs (Q626958) (← links)
- The power of digraph products applied to labelings (Q658044) (← links)
- Bipartite variation of the cheesecake factory problem: \(mH(k,2l+1)\)-factorization of \(K_{n,n}\) (Q658064) (← links)
- The method of moments and degree distributions for network models (Q661156) (← links)
- A new recursive theorem on \(n\)-extendibility (Q675894) (← links)
- Some upper bounds for the product of the domination number and the chromatic number of a graph (Q685554) (← links)
- A neighborhood condition which implies the existence of a complete multipartite subgraph (Q685590) (← links)
- Basic derivations for subarrangements of Coxeter arrangements (Q687005) (← links)
- Bounds relating generalized domination parameters (Q687110) (← links)
- Planar graphs and greatest common subgraphs (Q687720) (← links)
- On partitional and other related graphs (Q691629) (← links)
- Super edge-magic models (Q691632) (← links)
- Near-minimal spanning trees: A scaling exponent in probability models (Q731711) (← links)
- Cellular automata and discrete neural networks (Q807039) (← links)
- Upper bound for linear arboricity (Q809087) (← links)
- The game chromatic number and the game colouring number of cactuses (Q845991) (← links)
- Generalised game colouring of graphs (Q878606) (← links)
- Trees with maximum number of maximal matchings (Q878628) (← links)
- Size of weakly saturated graphs (Q878645) (← links)
- Pairs of trees in tree--tree triangulations (Q878648) (← links)
- Langford sequences and a product of digraphs (Q901157) (← links)
- Crosscap of the ideal based zero-divisor graph (Q903347) (← links)
- On a neighborhood condition implying the existence of disjoint complete graphs (Q911615) (← links)
- Infinite families of bi-embeddings (Q917565) (← links)
- On the relations of graph parameters and its total parameters (Q993698) (← links)
- Sorting a sequence of strong kings in a tournament (Q1014449) (← links)
- On randomly n-cyclic digraphs (Q1091397) (← links)
- On the \(\ell\)-connectivity of a graph (Q1094432) (← links)
- The connected cutset connectivity of a graph (Q1101465) (← links)
- The line digraph of a regular and pancircular digraph is also regular and pancircular (Q1111564) (← links)
- \(P_ 3\)-factorization of complete bipartite graphs (Q1117248) (← links)
- The longest cycles in a graph G with minimum degree at least \(| G| /k\) (Q1118613) (← links)
- Greatest common subgroups with specified properties (Q1119602) (← links)
- On renaming a set of clauses as a Horn set (Q1120278) (← links)
- Some topics in cochromatic theory (Q1121278) (← links)
- On the ascending subgraph decompositions of regular graphs (Q1129810) (← links)
- Partitioning regular graphs into equicardinal linear forests (Q1174174) (← links)
- On multipartite tournaments (Q1179479) (← links)
- An Ore-type condition for the existence of \(k\)-factors in graphs (Q1180675) (← links)
- Contractible edges in non-separating cycles (Q1181016) (← links)
