20 results on '"Golovach, Petr"'
Search Results
2. Enumeration of minimal connected dominating sets for chordal graphs
3. Enumeration and maximum number of maximal irredundant sets for chordal graphs
4. Computing square roots of graphs with low maximum degree
5. Minimal dominating sets in interval graphs and trees
6. On recognition of threshold tolerance graphs and their complements
7. Graph editing to a fixed target
8. Enumerating minimal dominating sets in chordal bipartite graphs
9. Coloring graphs characterized by a forbidden subgraph
10. Finding clubs in graph classes
11. Coloring graphs without short cycles and long induced paths
12. List coloring in the absence of two subgraphs
13. 4-coloring [formula omitted]-free graphs when [formula omitted] is small
14. 4-coloring H-free graphs when H is small
15. Distance three labelings of trees
16. Edge search number of cographs
17. Parameterized complexity of generalized domination problems
18. Containment relations in split graphs
19. Complexity of the packing coloring problem for trees
20. Interval degree and bandwidth of a graph
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.