44 results on '"*GRAPHIC methods"'
Search Results
2. Degree sum and nowhere-zero 3-flows
3. The number of vertices of degree 7 in a contraction-critical 7-connected graph
4. Clique-width of graphs defined by one-vertex extensions
5. Graphical complexity of products of permutation groups
6. Vertex-distinguishing proper edge colourings of some regular graphs
7. A survey on the distance-colouring of graphs
8. On biclique coverings
9. Graphs encoding 3-manifolds of genus 2
10. Double graphs
11. Resolvable 4-cycle group divisible designs with two associate classes: Part size even
12. Classification of Veronesean caps
13. Ideals and graphs, Gröbner bases and decision procedures in graphs
14. 3-Kings in 3-partite tournaments
15. Complementary multiplicative hyperrings
16. A short update on equipackable graphs
17. Sufficient conditions for restricted-edge-connectivity to be optimal
18. Even subgraphs of bridgeless graphs and 2-factors of line graphs
19. The crossing number of
20. Line graphs of bounded clique-width
21. Caterpillar arboricity of planar graphs
22. Linear layouts measuring neighbourhoods in graphs
23. Edge-disjoint spanners in Cartesian products of graphs
24. The 3-choosability of plane graphs of girth 4
25. Sparse graph certificates for mixed connectivity
26. Generalized subgraph-restricted matchings in graphs
27. Balanced colourings of strongly regular graphs
28. On self-complementary supergraphs of -graphs
29. A new degree condition for graphs to have -factor
30. Homomorphic images of
31. Rigidity and separation indices of Paley graphs
32. When n-cycles in n-partite tournaments are longest cycles
33. Minimal congestion trees
34. On integral graphs which belong to the class <f><ovl type="bar" STYLE="S">αKa∪βKb,b</ovl></f>
35. Cyclically decomposing the complete graph into cycles
36. A new Tura´n-type theorem for cliques in graphs
37. The number of spanning trees in odd valent circulant graphs
38. Relaxed game chromatic number of trees and outerplanar graphs
39. Some new bounds on the spectral radius of graphs
40. The structure of <f>(t,r)</f>-regular graphs of large order
41. On self-dual codes over some prime fields
42. On the non-existence of quasi-3 designs
43. Lower bounding the boundary of a graph in terms of its maximum or minimum degree
44. Construction of a family of graphs with a small induced proper subgraph with minimum degree 3
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.