Search

Showing total 200 results

Search Constraints

Start Over You searched for: Search Limiters Peer Reviewed Remove constraint Search Limiters: Peer Reviewed Publisher discrete mathematics & theoretical computer science (dmtcs) Remove constraint Publisher: discrete mathematics & theoretical computer science (dmtcs)
200 results

Search Results

1. Leanness Computation: Small Values and Special Graph Classes.

2. A note on removable edges in near-bricks.

3. On the rix statistic and valley-hopping.

4. A new sufficient condition for a 2-strong digraph to be Hamiltonian.

5. On harmonious coloring of hypergraphs.

6. Weakly toll convexity and proper interval graphs.

7. Further enumeration results concerning a recent equivalence of restricted inversion sequences.

8. Introduction to local certification.

9. (k - 2)-linear connected components in hypergraphs of rank k.

10. Exactly Hittable Interval Graphs.

11. Minimal toughness in special graph classes.

12. Gossiping with interference in radio ring networks.

13. Antisquares and Critical Exponents.

14. On Mixed Cages.

15. Pseudoperiodic Words and a Question of Shevelev.

16. The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis.

17. From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows.

18. Rainbow vertex pair-pancyclicity of strongly edge-colored graphs.

19. Gallai's Path Decomposition for 2-degenerate Graphs.

20. Distinct Angles and Angle Chains in Three Dimensions.

21. Several Roman domination graph invariants on Kneser graphs.

22. Zero-sum partitions of Abelian groups of order 2n.

23. Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs.

24. Proofs of Conjectures about Pattern-Avoiding Linear Extensions.

25. Structure of conflict graphs in constrained alignment problems and algorithms.

26. Approximability results for the p-centdian and the converse centdian problems.

27. Proximity, remoteness and maximum degree in graphs.

28. A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum.

29. Restricted generating trees for weak orderings.

30. Freezing, Bounded-Change and Convergent Cellular Automata.

31. Separating Layered Treewidth and Row Treewidth.

32. Domination in Knödel graphs.

33. Determining Number of Kneser Graphs: Exact Values and Improved Bounds.

34. An explicit construction of graphs of bounded degree that are far from being Hamiltonian.

35. On the Connectivity of Token Graphs of Trees.

36. Notes on equitable partitions into matching forests in mixed graphs and into b-branchings in digraphs.

37. The structure and the list 3-dynamic coloring of outer-1-planar graphs.

38. The treewidth of 2-section of hypergraphs.

39. Five results on maximizing topological indices in graphs.

40. Certificate complexity and symmetry of nested canalizing functions.

41. Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs.

42. Fast Diameter Computation within Split Graphs.

43. Determining the Hausdorff Distance Between Trees in Polynomial Time.

44. List-antimagic labeling of vertex-weighted graphs.

45. Exponential multivalued forbidden configurations.

46. Efficient Enumeration of Non-isomorphic Interval Graphs.

47. Anti-power j-fixes of the Thue-Morse word.

48. Vertex ordering with optimal number of adjacent predecessors.

49. A method for eternally dominating strong grids.

50. Analysis of a Model for Generating Weakly Scale-free Networks.