The following pages link to (Q4187840):
Displayed 50 items.
- On the first-order edge tenacity of a graph (Q266912) (← links)
- A note on extended stable sets (Q331706) (← links)
- Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles (Q410649) (← links)
- On the solution of \(w\)-stable sets (Q502372) (← links)
- Cayley digraphs and (1,j,n)-sequencings of the alternating groups \(A_ n\) (Q580356) (← links)
- On the factor-thickness of regular graphs (Q583237) (← links)
- A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs (Q595678) (← links)
- On the divisibility of the cycle number by 7 (Q687147) (← links)
- Long cycles in graphs with large degree sums (Q749553) (← links)
- Extending cycles in graphs (Q750461) (← links)
- Bidirectional retracting-free double tracings and upper embeddability of graphs (Q751672) (← links)
- Packing sequences (Q787987) (← links)
- Regular graphs and edge chromatic number (Q790826) (← links)
- Maximum graphs with a unique k-factor (Q790832) (← links)
- Maximum non-path-connected graphs (Q792336) (← links)
- Bounds on graph spectra (Q792343) (← links)
- Upper bounds on the edge clique cover number of a graph (Q799696) (← links)
- On cycle permutation graphs (Q802578) (← links)
- The search for chromatically unique graphs (Q803145) (← links)
- Sufficient conditions for a graph to have factors (Q803162) (← links)
- Fuzzy shortest paths (Q805505) (← links)
- Path extendable graphs (Q805629) (← links)
- Markov loops, free field and Eulerian networks (Q904203) (← links)
- Enumeration of packed graphs (Q908940) (← links)
- Two-colorings of a dense subgroup of \({\mathbb{Q}}^ n\) that forbid many distances (Q913798) (← links)
- Displacement operator based decompositions of matrices using circulants or other group matrices (Q918633) (← links)
- A simple proof of a theorem of Jung (Q918991) (← links)
- Whitney numbers of the second kind for the star poset (Q919015) (← links)
- A minimum length covering subgraph of a network (Q920001) (← links)
- On the order of uniquely (k,m)-colourable graphs (Q923092) (← links)
- Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle (Q1025926) (← links)
- Proof of a conjecture of Haeggkvist on cycles and independent edges (Q1050353) (← links)
- Cohesion and stability in graphs (Q1050359) (← links)
- A note on the complexity of finding regular subgraphs (Q1059641) (← links)
- On a construction of critical graphs which are not sensitive (Q1064327) (← links)
- Randomly n-cyclic digraphs (Q1065824) (← links)
- Eccentric graphs (Q1066166) (← links)
- Homogeneously representable interval graphs (Q1066922) (← links)
- Degree sets of degree uniform graphs (Q1068111) (← links)
- Graphs with unique maximum independent sets (Q1069954) (← links)
- Generalized complementation (Q1072574) (← links)
- Factors of regular graphs (Q1074601) (← links)
- Uniquely cocolourable graphs (Q1079577) (← links)
- The ith Ramsey number for matchings (Q1081620) (← links)
- Clique graphs of packed graphs (Q1082356) (← links)
- Contractible edges in 3-connected graphs (Q1087557) (← links)
- Connected graphs containing a given connected graph as a unique greatest common subgraph (Q1087564) (← links)
- Multiterminal duality and three-terminal series-parallelness (Q1090687) (← links)
- Ramsey numbers for unions of some cycles (Q1097901) (← links)
- Packing trees in complete graphs (Q1101132) (← links)