Pages that link to "Item:Q2494727"

The following pages link to The monadic second-order logic of graphs. XV: On a conjecture by D. Seese (Q2494727):

Displaying 10 items.

• The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
• Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
• Circle graphs and monadic second-order logic (Q946577) (← links)
• Constrained-path labellings on graphs of bounded clique-width (Q1959385) (← links)
• On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
• Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
• Rabin's theorem in the concurrency setting: a conjecture (Q2253187) (← links)
• The rank-width of edge-coloured graphs (Q2392245) (← links)
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
• Betweenness of partial orders (Q5021103) (← links)