Fast recognition of doubled graphs (Q385965)

From MaRDI portal

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

Fast recognition of doubled graphs (English)

0 references

Frédéric Maffray

0 references

Theoretical Computer Science

0 references

publication date

13 December 2013

0 references

zbMATH Keywords

double split graph

0 references

recognition

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2013.11.020

0 references

Forbidden Induced Subgraphs of Double-split Graphs

0 references

The strong perfect graph theorem

0 references

0 references

Geometric algorithms and combinatorial optimization

0 references

The splittance of a graph

0 references

An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph

0 references

A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.TCS.2013.11.020

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:385965

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q385965&oldid=38327238"