scientific article; zbMATH DE number 7561610
From MaRDI portal
Publication:5091279
Recommendations
- Upper bounds of the spectral radius of graphs in terms of genus
- scientific article; zbMATH DE number 1501715
- A tight lower bound on the maximum genus of a simplicial graph
- Lower bounds of the maximum genus on graphs in terms of diameter and girth
- Lower bounds on the maximum genus of a connected graph
- On the lower bounds for the maximum genus for simple graphs
- scientific article; zbMATH DE number 5583076
- A separator theorem for graphs of bounded genus
- Mathematical Foundations of Computer Science 2004
- The Bidimensional Theory of Bounded-Genus Graphs
Cites work
- An optimal lower bound on the number of variables for graph identification
- Definable ellipsoid method, sums-of-squares proofs, and the isomorphism problem
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Engineering an efficient canonical labeling tool for large and sparse graphs
- Exploiting symmetries for scaling loopy belief propagation and relational training
- Fixed-point definability and polynomial time on graphs with excluded minors
- Graph isomorphism in quasipolynomial time (extended abstract)
- Graph isomorphism, color refinement, and compactness
- Graphs identified by logics with counting
- Graphs on surfaces
- Hardness of robust graph isomorphism, Lasserre gaps, and asymmetry of random graphs
- scientific article; zbMATH DE number 5776838 (Why is no real title available?)
- scientific article; zbMATH DE number 3823850 (Why is no real title available?)
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 979011 (Why is no real title available?)
- scientific article; zbMATH DE number 1392292 (Why is no real title available?)
- Interval graphs: canonical representations in logspace
- Isomorphism testing for embeddable graphs through definability
- Limitations of algebraic approaches to graph isomorphism testing
- Lov\'asz Meets Weisfeiler and Leman
- On the combinatorial power of the Weisfeiler-Lehman algorithm
- On Tinhofer's linear programming approach to isomorphism testing
- PEBBLE GAMES AND LINEAR EQUATIONS
- Practical graph isomorphism. II.
- Sherali-Adams relaxations and indistinguishability in counting logics
- Sherali-Adams relaxations of graph isomorphism polytopes
- The Weisfeiler-Leman dimension of planar graphs is at most 3
- Universal covers, color refinement, and two-variable counting logic: lower bounds for the depth
- Weisfeiler-Lehman graph kernels
Cited in
(15)- The Weisfeiler-Leman dimension of chordal bipartite graphs without bipartite claw
- The power of the Weisfeiler-Leman algorithm to decompose graphs
- The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3
- Canonisation and Definability for Graphs of Bounded Rank Width
- The Weisfeiler-Leman dimension of distance-hereditary graphs
- A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus
- Count-free Weisfeiler-Leman and group isomorphism
- On the Weisfeiler-Leman dimension of permutation graphs
- The iteration number of colour refinement
- On the descriptive complexity of groups without abelian normal subgroups
- On the parallel complexity of group isomorphism via Weisfeiler-Leman
- Canonizing graphs of bounded rank-width in parallel via Weisfeiler-Leman
- Bounding the Weisfeiler-Leman dimension via a depth analysis of I/R-trees
- Logarithmic Weisfeiler-Leman identifies all planar graphs
- Finite variable counting logics with restricted requantification
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091279)
