On Numerical Invariant of Graph
From MaRDI portal
Publication:5029640
Cites work
- scientific article; zbMATH DE number 3842680 (Why is no real title available?)
- scientific article; zbMATH DE number 3268843 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- An Algebraic Proof of Kirchhoff's Network Theorem
- Closing in on Hill's conjecture
- Crossing number for graphs with bounded pathwidth
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
- Graph theory
- Harmonic cycles for graphs
- On the crossing number of \(K_n\) without computer assistance
- On the crossing number of \(K_{13}\)
- The crossing number of K11 is 100
- The crossing number of K5,n
- The crossing number of \(K_{5,n+1} \setminus e\)
- Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
Cited in
(4)- Graphentheoretische Ermittlung der Anzahl von strukturellen und streng strukturellen Invarianten Nullstellen / Graph-theoretical determination of the number of structural and strictly structural invariant zeros
- scientific article; zbMATH DE number 1868509 (Why is no real title available?)
- On real number labelings and graph invertibility
- Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants
This page was built for publication: On Numerical Invariant of Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5029640)