Bielak H,Gorgol I.The planar Ramsey number for C4 and K5 is 13. Discrete Mathematics . 2001GORGOL I. Planar Ramsey Numbers [ J ]. Discussi_ones Mathematicae Graph Theory, 2005,25 ( 1 ) :45-50.H. Bielak, I. Gorgol, The planar Ramsey number for C4 and K5 is 13, Discrete Math. ...
proves the case when the graph is O(1)-outerplanar; Chakrabarti et al. proves a natural analogous case when the graph is (K5-e)-free. Barnette conjecture (not the one about Hamiltonian cycle)— There is always non-null-homotopic separating simple cycle on every triangulation of an orient...
Graphs without the excluded minor K5\\eHamilton cycle problem90C27Given a graph $$G=(V, E)$$ G = ( V , E ) , a connected cut $$\\delta (U)$$ 未 ( U ) is the set of edges of E linking all vertices of U to all vertices of $$V\\backslash U$$ V \\ U such that ...
Given k1=k2=k3=k4=k5=k The fatigue data for a brass alloy are given as follows:...a) Make an S-N (stress amplitude versus logarithm cycle to failure) on a graph paper using the data. Label the axes with proper units. b) D From the definition of percent cold work, demonstrate ...