A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs
From MaRDI portal
Publication:6565816
DOI10.1002/JGT.23099zbMATH Open1542.05082MaRDI QIDQ6565816FDOQ6565816
Authors: Yan-Ting Xie, Yong-De Feng, S. J. Xu
Publication date: 2 July 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Recommendations
Cites Work
- Theory of monomer-dimer systems
- A canonical decomposition theory for metrics on a finite set
- A criterion for unimodality
- Chromatic polynomials and logarithmic concavity
- Handbook of product graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- n‐cubes and median graphs
- Title not available (Why is that?)
- Isometric embedding in products of complete graphs
- Clique polynomials and independent set polynomials of graphs
- On the numbers of independent \(k\)-sets in a claw free graph
- Distance-preserving subgraphs of hypercubes
- Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
- Unimodal, log-concave and Pólya frequency sequences in combinatorics
- Title not available (Why is that?)
- Resonance Graphs and a Binary Coding for the 1-Factors of Benzenoid Systems
- The structure of median graphs
- A fixed cube theorem for median graphs
- A convexity lemma and expansion procedures for bipartite graphs
- The cube polynomial and its derivatives: The case of median graphs
- Title not available (Why is that?)
- Partial cubes and crossing graphs
- The Clar covering polynomial of hexagonal systems. I
- The Clar covering polynomial of hexagonal systems. III
- Title not available (Why is that?)
- A relation between Clar covering polynomial and cube polynomial
- Superextensions and the depth of median graphs
- Nested unimodality
This page was built for publication: A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565816)