The following pages link to (Q3097395):
Displaying 50 items.
- Some extremal graphs with respect to inverse degree (Q260055) (← links)
- On degree resistance distance of cacti (Q260066) (← links)
- Realizability of fault-tolerant graphs (Q262985) (← links)
- \(g\)-good-neighbor conditional diagnosability measures for 3-ary \(n\)-cube networks (Q264588) (← links)
- Weak saturation number for multiple copies of the complete graph with a star removed (Q266847) (← links)
- Classification of finite commutative rings with planar, toroidal, and projective line graphs associated with Jacobson graphs (Q268085) (← links)
- On energy of line graphs (Q269530) (← links)
- Heavy subgraph conditions for longest cycles to be heavy in graphs (Q274691) (← links)
- The cycle's structure of embedded graphs in surfaces (Q277096) (← links)
- Hamiltonian cycle embedding for fault tolerance in balanced hypercubes (Q278371) (← links)
- jHoles: a tool for understanding biological complex networks via clique weight rank persistent homology (Q281275) (← links)
- Acyclic coloring of graphs with some girth restriction (Q281769) (← links)
- A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773) (← links)
- Inverse 1-median problem on block graphs with variable vertex weights (Q283940) (← links)
- The \(g\)-good-neighbor conditional diagnosability of \(n\)-dimensional hypercubes under the MM* model (Q284352) (← links)
- Hamiltonian decomposition of generalized recursive circulant graphs (Q284357) (← links)
- An extremal problem on bigraphic pairs with an \(A\)-connected realization (Q284713) (← links)
- Generalized probabilistic \(G\)-contractions (Q284900) (← links)
- An implicit degree condition for relative length of long paths and cycles in graphs (Q287873) (← links)
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913) (← links)
- On the spectral moment of graphs with given clique number (Q289719) (← links)
- 0-sum and 1-sum flows in regular graphs (Q289977) (← links)
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. (Q290801) (← links)
- Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights. (Q290803) (← links)
- Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions (Q293647) (← links)
- Updating \(\leqslant, <\)-chains (Q294886) (← links)
- A note on edge-disjoint Hamilton cycles in line graphs (Q295256) (← links)
- Embedding generalized Petersen graph in books (Q295940) (← links)
- Topological indices of the line graph of subdivision graphs and their Schur-bounds (Q298865) (← links)
- Hamiltonian cycles in spanning subgraphs of line graphs (Q298990) (← links)
- A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles (Q306111) (← links)
- An improved bound on 2-distance coloring plane graphs with girth 5 (Q306114) (← links)
- Minimum implicit degree condition restricted to claws for Hamiltonian cycles (Q308339) (← links)
- A note on the complexity of the causal ordering problem (Q309924) (← links)
- Cubic non-Cayley vertex-transitive bi-Cayley graphs over a regular \(p\)-group (Q311550) (← links)
- On the hyperbolicity of bipartite graphs and intersection graphs (Q317426) (← links)
- Hamilton cycles in almost distance-hereditary graphs (Q317825) (← links)
- Clique-heavy subgraphs and pancyclicity of 2-connected graphs (Q318913) (← links)
- Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs (Q326469) (← links)
- Neighbor sum distinguishing total choosability of planar graphs (Q326491) (← links)
- Maximum size of digraphs with some parameters (Q326498) (← links)
- A diagnosis algorithm by using graph-coloring under the PMC model (Q326504) (← links)
- A note on the minimum total coloring of planar graphs (Q326982) (← links)
- Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs (Q327292) (← links)
- Some class 1 graphs on \(g_c\)-colorings (Q335318) (← links)
- Degree sum of a pair of independent edges and \(Z_{3}\)-connectivity (Q335575) (← links)
- Perfect set of Euler tours of \(K_{p,p,p}\) (Q339456) (← links)
- On the edge-hyper-Hamiltonian laceability of balanced hypercubes (Q339462) (← links)
- Maximising expectation of the number of transplants in kidney exchange programmes (Q342402) (← links)
- Word-representability of face subdivisions of triangular grid graphs (Q343715) (← links)
