Pages that link to "Item:Q1331889"
From MaRDI portal
The following pages link to Linear recognition of pseudo-split graphs (Q1331889):
Displaying 25 items.
- On realization graphs of degree sequences (Q284753) (← links)
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Split graphs and Nordhaus-Gaddum graphs (Q297938) (← links)
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs (Q389453) (← links)
- Hereditary unigraphs and Erdős-Gallai equalities (Q389468) (← links)
- On fractional realizations of graph degree sequences (Q405210) (← links)
- Non-minimal degree-sequence-forcing triples (Q497308) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- Dynamically maintaining split graphs (Q1026107) (← links)
- On the use of Boolean methods for the computation of the stability number (Q1363750) (← links)
- A coloring algorithm for \(4 K_1\)-free line graphs (Q1686052) (← links)
- Star coloring of certain graph classes (Q1706426) (← links)
- Chromatic bounds for some classes of \(2 K_2\)-free graphs (Q1783621) (← links)
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum (Q1827854) (← links)
- On the stable set problem in special \(P_{5}\)-free graphs (Q1861559) (← links)
- The principal Erdős-Gallai differences of a degree sequence (Q2075508) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- Sandwiches missing two ingredients of order four (Q2288872) (← links)
- Minimal forbidden sets for degree sequence characterizations (Q2344782) (← links)
- On graphs with a single large Laplacian eigenvalue (Q2413188) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- (Q2741457) (← links)
- Exploring the Subexponential Complexity of Completion Problems (Q2828210) (← links)
- Upward-closed hereditary families in the dominance order (Q5024680) (← links)
