The following pages link to Yoshimi Egawa (Q234310):
Displaying 50 items.
- Upper bounds on the paired domination subdivision number of a graph (Q354438) (← links)
- A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees (Q397062) (← links)
- Toughness of \(K_{a,t}\)-minor-free graphs (Q554002) (← links)
- Forbidden triples containing a complete graph and a complete bipartite graph of small order (Q742629) (← links)
- Forbidden pairs for \(k\)-connected Hamiltonian graphs (Q764879) (← links)
- Automorphism groups of multilinear mappings (Q790939) (← links)
- Independence number and vertex-disjoint cycles (Q878646) (← links)
- Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph (Q932669) (← links)
- \(K_{1,3}\)-factors in graphs (Q998329) (← links)
- Edges not contained in triangles and the number of contractible edges in a 4-connected graph (Q998425) (← links)
- On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs (Q1012442) (← links)
- Arbitrary decompositions into open and closed trails (Q1024460) (← links)
- 5-shredders in 5-connected graphs (Q1024472) (← links)
- 4-factors in 2-connected star-free graphs (Q1045021) (← links)
- Association schemes of quadratic forms (Q1057869) (← links)
- Automorphism groups of \(\Sigma _{n+1}\)-invariant trilinear forms (Q1061830) (← links)
- Characterization of the Cartesian product of complete graphs by convex subgraphs (Q1076038) (← links)
- A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components (Q1078203) (← links)
- On component factors (Q1078207) (← links)
- Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph (Q1089006) (← links)
- On randomly n-cyclic digraphs (Q1091397) (← links)
- (Q1116955) (redirect page) (← links)
- Cycles and paths through specified vertices in k-connected graphs (Q1116957) (← links)
- The longest cycles in a graph G with minimum degree at least \(| G| /k\) (Q1118613) (← links)
- Factors and induced subgraphs (Q1120595) (← links)
- Characterization of H(n,q) by the parameters (Q1158175) (← links)
- Standard subgroups of type \(2\Omega+(8,2)\) (Q1171642) (← links)
- Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\) (Q1175546) (← links)
- A mixed version of Menger's theorem (Q1180411) (← links)
- Contractible edges in non-separating cycles (Q1181016) (← links)
- Spanning trees in a cactus (Q1208370) (← links)
- Vertex-disjoint claws in graphs (Q1292832) (← links)
- The minimum number of edges in a vertex diameter-2-critical graph (Q1356444) (← links)
- Contractible cycles in graphs with large minimum degree (Q1363691) (← links)
- Graph labelings in elementary abelian 2-groups (Q1382846) (← links)
- Covering vertices of a graph by \(k\) disjoint cycles (Q1406550) (← links)
- Contractible cycles in graphs with girth at least 5 (Q1569031) (← links)
- Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles (Q1637143) (← links)
- Structure of edges in a 4-connected graph not contained in triangles and the number of contractible edges (Q1713578) (← links)
- The graph grabbing game on \(K_{m, n}\)-trees (Q1744738) (← links)
- The existence of a path-factor without small odd paths (Q1753005) (← links)
- Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles (Q1756041) (← links)
- Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph (Q1792054) (← links)
- The maximal number of induced \(r\)-partite subgraphs (Q1805369) (← links)
- Graphs G for which G and \(\bar G\) are both semidecomposable (Q1820170) (← links)
- Maximum number of edges in a critically \(k\)-connected graph (Q1861238) (← links)
- Graphs \(G\) for which both \(G\) and \(\overline {G}\) are contraction critically \(k\)-connected (Q1865622) (← links)
- Non-contractible edges in a 3-connected graph (Q1900184) (← links)
- Sufficient conditions for graphs to have \((g,f)\)-factors (Q1916381) (← links)
- Vertex-disjoint cycles of the same length (Q1924121) (← links)
