Diamond-free circle graphs are Helly circle (Q965965): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2003721214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing prime graphs and recognizing circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graph obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graphs and monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing circle graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graph obstructions under pivoting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical and efficient split decomposition via graph-labelled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical and efficient circle graph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconnaissance des graphes de cordes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding a bipartite circle graph from line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of Circle Graphs / rank
 
Normal rank

Revision as of 18:16, 2 July 2024

scientific article
Language Label Description Also known as
English
Diamond-free circle graphs are Helly circle
scientific article

    Statements

    Identifiers