Pages that link to "Item:Q3663349"
From MaRDI portal
The following pages link to The Complexity of the Partial Order Dimension Problem (Q3663349):
Displaying 22 items.
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- (Q5111878) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial (Q5499731) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- Deciding the Bell number for hereditary graph properties (Q5890662) (← links)
- Dominating cliques in graphs (Q5896554) (← links)
- On minimal forbidden subgraph characterizations of balanced graphs (Q5920323) (← links)
- Dominating cliques in graphs (Q5925264) (← links)
- On \(H\)-topological intersection graphs (Q5925535) (← links)
- The lexicographic method for the threshold cover problem (Q5925705) (← links)
- Ray shooting from convex ranges (Q5929310) (← links)
- Happy set problem on subclasses of co-comparability graphs (Q6069926) (← links)
- On 4-Sachs optimal graphs (Q6117083) (← links)
- Algorithmic Aspects of Quasi-Total Roman Domination in Graphs (Q6158956) (← links)
- Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs (Q6174822) (← links)
- Vertex ranking of asteroidal triple-free graphs (Q6487437) (← links)
- Well-quasi-ordering and Embeddability of Relational Structures (Q6493759) (← links)
- Threshold graphs and synchronization protocols (Q6567697) (← links)
- Word-representability of graphs with respect to split recomposition (Q6611031) (← links)
- Recognizing unit multiple interval graphs is hard (Q6648267) (← links)
- Intersection of chordal graphs and some related partition problems (Q6657232) (← links)
