Fast recognition of doubled graphs (Q385965): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.11.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994851674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Induced Subgraphs of Double-split Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splittance of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G / rank
 
Normal rank

Latest revision as of 03:32, 7 July 2024

scientific article
Language Label Description Also known as
English
Fast recognition of doubled graphs
scientific article

    Statements

    Identifiers