Linear recognition of pseudo-split graphs
From MaRDI portal
Publication:1331889
DOI10.1016/0166-218X(94)00022-0zbMath0805.05069MaRDI QIDQ1331889
Myriam Preissmann, Frédéric Maffray
Publication date: 26 January 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (25)
On realization graphs of degree sequences ⋮ Win-win kernelization for degree sequence completion problems ⋮ Split graphs and Nordhaus-Gaddum graphs ⋮ Vizing bound for the chromatic number on some graph classes ⋮ On the use of Boolean methods for the computation of the stability number ⋮ Vertex coloring of graphs with few obstructions ⋮ Unnamed Item ⋮ On graphs with a single large Laplacian eigenvalue ⋮ \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs ⋮ Hereditary unigraphs and Erdős-Gallai equalities ⋮ A coloring algorithm for \(4 K_1\)-free line graphs ⋮ On fractional realizations of graph degree sequences ⋮ Star coloring of certain graph classes ⋮ Non-minimal degree-sequence-forcing triples ⋮ Recognition of split-graphic sequences ⋮ Chromatic bounds for some classes of \(2 K_2\)-free graphs ⋮ On the complete width and edge clique cover problems ⋮ Sandwiches missing two ingredients of order four ⋮ Dynamically maintaining split graphs ⋮ Exploring the Subexponential Complexity of Completion Problems ⋮ Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum ⋮ The principal Erdős-Gallai differences of a degree sequence ⋮ Minimal forbidden sets for degree sequence characterizations ⋮ On the stable set problem in special \(P_{5}\)-free graphs ⋮ Upward-closed hereditary families in the dominance order
Cites Work
This page was built for publication: Linear recognition of pseudo-split graphs
