Pages that link to "Item:Q2414456"

The following pages link to On the thinness and proper thinness of a graph (Q2414456):

Displaying 12 items.

• Thinness of product graphs (Q831864) (← links)
• Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
• On the classes of interval graphs of limited nesting and count of lengths (Q1739103) (← links)
• Precedence thinness in graphs (Q2091785) (← links)
• Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees (Q2420639) (← links)
• Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
• Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs (Q6064836) (← links)
• Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
• On \(d\)-stable locally checkable problems parameterized by mim-width (Q6202932) (← links)
• Knapsack: connectedness, path, and shortest-path (Q6547953) (← links)
• Thinness and its variations on some graph families and coloring graphs of bounded thinness (Q6550911) (← links)
• Twin-width and transductions of proper \(k\)-mixed-thin graphs (Q6552597) (← links)