Graph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs
This paper deal with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chrdal graphs. It is known that GI problem is GI complete for some special graph classes including regular graphs, bipartite graphs, chordal graphs, comparability graphs, split graphs, and k-trees for unbounded k.
openaire
Optimal Designs for Discrete Choice Models Via Graph Laplacians. [PDF]
Röttger F, Kahle T, Schwabe R.
europepmc +1 more source
Orthology and near-cographs in the context of phylogenetic networks. [PDF]
Lindeberg A +3 more
europepmc +1 more source
Exact and parameterized algorithms for choosability. [PDF]
Bliznets I, Nederlof J.
europepmc +1 more source
Single-cell analysis identified key macrophage subpopulations associated with atherosclerosis. [PDF]
Zhao Z, Qin Y, Wu R, Li W, Dong Y.
europepmc +1 more source
10-tough chordal graphs are Hamiltonian [PDF]
A. Kabela, Tomás Kaiser
semanticscholar +1 more source
Novel representation of complexity of investment casting using injective coloring and graph adaptive consensus mechanism. [PDF]
Mobarsa D +4 more
europepmc +1 more source
Single-cell 3D genome reconstruction in the haploid setting using rigidity theory. [PDF]
Dewar S +4 more
europepmc +1 more source
ChoCo: a Chord Corpus and a Data Transformation Workflow for Musical Harmony Knowledge Graphs. [PDF]
de Berardinis J +3 more
europepmc +1 more source

