Recognition of split-graphic sequences
From MaRDI portal
Publication:2254547
Cites work
- A generalization of a conjecture due to Erdös, Jacobson and Lehel
- A Havel-Hakimi type procedure and a sufficient condition for a sequence to be potentially S r,s -graphic
- A note on Hamiltonian split graphs
- A Rao-type characterization for a sequence to have a realization containing a split graph
- A Rao-type characterization for a sequence to have a realization containing an arbitrary subgraph H
- A remark on the existence of finite graphs
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
- A simple criterion on degree sequences of graphs
- Algorithms for constructing graphs and digraphs with given valences and factors
- An exact bit-parallel algorithm for the maximum clique problem
- An extension of A.R. Rao's characterization of potentially \(K_{m+1}\)-graphic sequences
- An extremal problem on the potentially \(P_k\)-graphic sequences
- Bisplit graphs
- Certifying algorithms
- Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
- Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs
- Conditions for \(r\)-graphic sequences to be potentially \(K^{(r)}_{m+1}\)-graphic
- Conditions for sequences to be r-graphic
- Constant-time parallel recognition of split graphs
- Covering a set by subsets
- Degree sequences of multigraphs
- Degree sequences of multigraphs
- Enumeration of graphs by degree sequence
- Fully dynamic algorithms for chordal graphs and split graphs
- Generalized split graphs and Ramsey numbers
- Graph Classes: A Survey
- Graphs \& digraphs
- Graphs with no induced \(C_ 4\) and \(2K_ 2\)
- Handbook of graph theory
- Hereditary unigraphs and Erdős-Gallai equalities
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3674138 (Why is no real title available?)
- scientific article; zbMATH DE number 3743297 (Why is no real title available?)
- scientific article; zbMATH DE number 3758373 (Why is no real title available?)
- scientific article; zbMATH DE number 3588696 (Why is no real title available?)
- scientific article; zbMATH DE number 1522332 (Why is no real title available?)
- scientific article; zbMATH DE number 867707 (Why is no real title available?)
- scientific article; zbMATH DE number 1424217 (Why is no real title available?)
- Introduction to algorithms.
- Linear recognition of pseudo-split graphs
- Linear-time certifying algorithms for near-graphical sequences
- Linear-time certifying recognition algorithms and forbidden induced subgraphs
- List Partitions
- Minimal split completions
- Necessary conditions for Hamiltonian split graphs
- On Erdös-Gallai and Havel-Hakimi algorithms
- On generalized split graphs
- On probe interval graphs
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On split and almost CIS-graphs
- On-line and first fit colorings of graphs
- Parallel enumeration of degree sequences
- Partitions of graphs into one or two independent sets and cliques
- Potentially graphic sequences of split graphs
- Probe split graphs
- Recognizing tough graphs is NP-hard
- Reconstruction of complete interval tournaments
- Reconstruction of complete interval tournaments. II
- Some Properties of Graphs with Multiple Edges
- Split and balanced colorings of complete graphs
- Split digraphs
- Split Graphs Having Dilworth Number Two
- Split graphs of Dilworth number 2
- The Dilworth Number of a Graph
- The Erdős-Gallai criterion and symmetric functions
- The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
- The maximum clique problem
- The splittance of a graph
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Tough graphs and Hamiltonian circuits.
- Toughness, hamiltonicity and split graphs
- Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
- Yet another method of enumerating unmarked combinatorial objects
Cited in
(2)
This page was built for publication: Recognition of split-graphic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2254547)
