Bisplit graphs

From MaRDI portal
Revision as of 07:47, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2568470

DOI10.1016/j.disc.2004.08.046zbMath1073.05059OpenAlexW2913396681WikidataQ56288395 ScholiaQ56288395MaRDI QIDQ2568470

Van Bang Le, Vadim V. Lozin, Andreas Brandstädt, Peter L. Hammer

Publication date: 10 October 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.08.046


zbMATH Keywords

split graphscomparability graphsinduced subgraph characterization


Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items

On Weak Integer Additive Set-Indexers of Certain Graph Classes ⋮ Polar graphs and maximal independent sets ⋮ On equistable, split, CIS, and related classes of graphs ⋮ Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration ⋮ Short cycles dictate dichotomy status of the Steiner tree problem on bisplit graphs ⋮ On the relation between the positive inertia index and negative inertia index of weighted graphs ⋮ Between 2- and 3-colorability ⋮ Recognition of split-graphic sequences ⋮ Stable-\(\Pi\) partitions of graphs ⋮ A forbidden subgraph characterization of line-polar bipartite graphs ⋮ A note on the recognition of bisplit graphs ⋮ Graph partitions with prescribed patterns ⋮ Join colourings of chordal graphs ⋮ Edge vulnerability parameters of bisplit graphs ⋮ Vulnerability of super connected split graphs and bisplit graphs ⋮ Recognizing Graphs Close to Bipartite Graphs ⋮ Maximally and super connected multisplit graphs and digraphs



Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2568470&oldid=15321605"
Powered by MediaWiki