Pages that link to "Item:Q4148003"
From MaRDI portal
The following pages link to On chromatic equivalence of graphs (Q4148003):
Displaying 50 items.
- Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles (Q410649) (← links)
- Chromaticity of a family of \(K_ 4\)-homeomorphs (Q686185) (← links)
- The chromaticity of wheels (Q798668) (← links)
- On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\) (Q868346) (← links)
- On chromaticity of hypergraphs (Q878636) (← links)
- Two classes of chromatically unique graphs (Q911611) (← links)
- The chromaticity of wheels with a missing spoke (Q923093) (← links)
- On chromatic and flow polynomial unique graphs (Q947115) (← links)
- Series-parallel chromatic hypergraphs (Q968129) (← links)
- Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle (Q1025926) (← links)
- On the chromaticity of complete multipartite graphs with certain edges added (Q1043578) (← links)
- Chromatic polynomials of generalized trees (Q1112057) (← links)
- Chromatic polynomials for regular graphs and modified wheels (Q1150375) (← links)
- On maximally saturated graphs (Q1169471) (← links)
- On the chromatic uniqueness of certain bipartite graphs (Q1182976) (← links)
- Chromatic uniqueness of the generalized \(\Theta\)-graph (Q1250829) (← links)
- Chromatically unique graphs (Q1259606) (← links)
- Chromatic coefficients of linear uniform hypergraphs (Q1272479) (← links)
- On chromatic uniqueness of uniform subdivisions of graphs (Q1322194) (← links)
- Classes of chromatically equivalent graphs and polygon trees (Q1336708) (← links)
- The chromaticity of \(s\)-bridge graphs and related graphs (Q1343275) (← links)
- On the chromatic equivalence class of a family of graphs (Q1356678) (← links)
- A new method for proving chromatic uniqueness of graphs (Q1363698) (← links)
- Some problems on chromatic polynomials (Q1366774) (← links)
- On T-chromatic uniqueness of graphs (Q1366776) (← links)
- Adjoint polynomials and chromatically unique graphs (Q1366781) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- The chromatic uniqueness of certain complete \(t\)-partite graphs. (Q1420623) (← links)
- Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. (Q1427480) (← links)
- Some families of chromatically unique bipartite graphs (Q1584227) (← links)
- On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs (Q1827719) (← links)
- Contraction-deletion invariants for graphs (Q1850504) (← links)
- Sunflower hypergraphs are chromatically unique (Q1877684) (← links)
- Graphs determined by polynomial invariants (Q1885023) (← links)
- Chromaticity of series-parallel graphs (Q1918563) (← links)
- Independence equivalence classes of cycles (Q2231721) (← links)
- Zeroth-order general Randić index of cactus graphs (Q2293835) (← links)
- On the chromaticity of quasi linear hypergraphs (Q2637737) (← links)
- A new family of chromatically unique 6-bridge graph (Q3295206) (← links)
- (Q3409422) (← links)
- (Q3644665) (← links)
- Classification of chromatically unique graphs having quadratic σ‐polynomials (Q4204167) (← links)
- (Q4379734) (← links)
- On chromaticity of graphs (Q4846682) (← links)
- (Q4853734) (← links)
- (Q4880947) (← links)
- Chromatically unique 6-bridge graph theta(a,a,a,b,b,c) (Q5006575) (← links)
- Independence Equivalence Classes of Paths and Cycles (Q5206913) (← links)
- Short certificates for chromatic equivalence (Q5377353) (← links)
- Hypergraphs with pendant paths are not chromatically unique (Q5405277) (← links)
