Pages that link to "Item:Q1247984"
From MaRDI portal
The following pages link to On a class of posets and the corresponding comparability graphs (Q1247984):
Displaying 50 items.
- Forbidden subgraphs for Hamiltonicity of 1-tough graphs (Q339484) (← links)
- On the spectrum of threshold graphs (Q410640) (← links)
- Extreme tenacity of graphs with given order and size (Q489128) (← links)
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs (Q673108) (← links)
- Hamiltonian properties of polyhedra with few 3-cuts. A survey (Q724894) (← links)
- Toughness and prism-Hamiltonicity of \(P_4\)-free graphs (Q777381) (← links)
- Cyclability in graph classes (Q833007) (← links)
- Parallel recognition of complement reducible graphs and cotree construction (Q919826) (← links)
- Vertex vulnerability parameters of Kronecker products of complete graphs (Q963383) (← links)
- Infinite versus finite graph domination (Q968422) (← links)
- Approximating the maximum internal spanning tree problem (Q1034535) (← links)
- Distance-hereditary graphs (Q1084114) (← links)
- Scattering number and extremal non-Hamiltonian graphs (Q1109047) (← links)
- Hereditary modular graphs (Q1112068) (← links)
- Complement reducible graphs (Q1153105) (← links)
- A catalogue of small maximal nonhamiltonian graphs (Q1161757) (← links)
- A tree representation for \(P_ 4\)-sparse graphs (Q1183332) (← links)
- Scattering number and modular decomposition (Q1356754) (← links)
- 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
- Measuring the vulnerability for classes of intersection graphs (Q1364473) (← links)
- A fast parallel algorithm to recognize P4-sparse graphs (Q1382265) (← links)
- Path partition for graphs with special blocks (Q1765521) (← links)
- Hamiltonicity in graphs with few \(P_ 4\)'s (Q1805009) (← links)
- Unavoidable doubly connected large graphs (Q1827667) (← links)
- The clique operator on cographs and serial graphs (Q1827743) (← links)
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs (Q1897361) (← links)
- An optimal path cover algorithm for cographs (Q1903198) (← links)
- Homomorphically full graphs (Q1917297) (← links)
- Toughness, forbidden subgraphs and pancyclicity (Q2045380) (← links)
- Toughness, forbidden subgraphs, and Hamilton-connected graphs (Q2062680) (← links)
- Algorithms for maximum internal spanning tree problem for some graph classes (Q2091107) (← links)
- Generalizing cographs to 2-cographs (Q2111769) (← links)
- Characterizing and computing weight-equitable partitions of graphs (Q2132504) (← links)
- The scattering number of strictly chordal graphs: linear time determination (Q2144221) (← links)
- Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees (Q2192103) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Graph vulnerability parameters, compression, and threshold graphs (Q2223690) (← links)
- Distance eigenvalues of a cograph and their multiplicities (Q2226412) (← links)
- A polynomial algorithm for computing the weak rupture degree of trees (Q2279643) (← links)
- Implementation of RTO in a large hydrogen network considering uncertainty (Q2302370) (← links)
- Cographs: eigenvalues and Dilworth number (Q2317646) (← links)
- Computing the weighted isolated scattering number of interval graphs in polynomial time (Q2325144) (← links)
- Bounds for scattering number and rupture degree of graphs with genus (Q2335659) (← links)
- Tree-core and tree-coritivity of graphs (Q2348704) (← links)
- Cographs which are cover-incomparability graphs of posets (Q2351716) (← links)
- Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
- A polynomial algorithm for weighted scattering number in interval graphs (Q2422741) (← links)
- On operations preserving semi-transitive orientability of graphs (Q2424730) (← links)
- Lower bounds for the Estrada index using mixing time and Laplacian spectrum (Q2439540) (← links)
- Vulnerability of nearest neighbor graphs (Q2449104) (← links)
