32 results on '"Broersma H"'
Search Results
2. Algorithms for the treewidth and minimum fill-in of HHD-free graphs
3. Around Three Lemmas in Hamiltonian Graph Theory
4. Evolution of a designless nanoparticle network into reconfigurable Boolean logic
5. Interpretation of Statistical Software Output: some Behavioral Studies
6. Best Monotone Degree Conditions for Graph Properties: A Survey
7. Toughness and Vertex Degrees
8. Tank-Ring Factors in Supereulerian Claw-Free Graphs
9. How Many Conjectures Can You Stand? A Survey
10. Degree Sequences and the Existence of k-Factors
11. On hamiltonicity of P 3-dominated graphs
12. Tutte sets in graphs I: Maximal tutte sets and D-graphs
13. A new upper bound on the cyclic chromatic number
14. An Affirmative Action Graph (D. J. Newman)
15. A NoteConcerning Hamilton Cycles in Some Classes of Grid Graphs
16. On factors of 4‐connected claw‐free graphs*
17. Toughness and longest cycles in 2-connected planar graphs
18. Hamiltonicity of regular 2-connected graphs
19. On graphs satisfying a local ore-type condition
20. Cycles through particular subgraphs of claw‐free graphs
21. Bipartite regular graphs with fixed diameter
22. On hamiltonian properties of 2-tough graphs
23. Generating all 3-connected 4-regular planar graphs from the octahedron graph
24. Cycles containing all vertices of maximum degree
25. Decomposition of bipartite graphs under degree constraints
26. Long paths and cycles in tough graphs
27. The connectivity of the basis graph of a branching greedoid
28. Long dominating cycles and paths in graphs with large neighborhood unions
29. Path graphs
30. 3‐Connected line graphs of triangular graphs are panconnected and 1‐hamiltonian
31. Existence of Δλ-cycles and Δλ-paths
32. Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.