Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for linegraph with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1979 (1) 1980 (1) 2008 (1) 2018 (1)
Publication types (Num. hits)
article(2) inproceedings(2)
Venues (Conferences, Journals, ...)
Discret. Math.(1) J. Comb. Theory, Ser. A(1) MCO(1) WG(1)
Authors
Agnes Hui Chan(1) Benoît Valéry(1) F. Sterboul(1) Jean-Claude Bermond(1) Meike Hatzel(1) Peter Frankl(1) Philippe Vismara(1) Sebastian Wiederrecht(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.
Results
Found 4 publication records. Showing 4 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
40Meike Hatzel, Sebastian Wiederrecht On Perfect Linegraph Squares. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
40Jean-Claude Bermond, Peter Frankl, F. Sterboul On the maximum number of edges in a hypergraph whose linegraph contains no cycle. Search on Bibsonomy Discret. Math. The full citation details ... 1980 DBLP  DOI  BibTeX  RDF
40Agnes Hui Chan Characterization of "Linegraph of an Affine Space". Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
36Philippe Vismara, Benoît Valéry Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms. Search on Bibsonomy MCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Maximum common subgraph, linegraph, subdivision graph, compatibility graph, constraints satisfaction algorithm, clique detection
Displaying result #1 - #4 of 4 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license