Found: 261
Select item for more details and to access through your institution.
Triangle-free subgraphs with large fractional chromatic number.
- Published in:
- Combinatorics, Probability & Computing, 2022, v. 31, n. 1, p. 136, doi. 10.1017/S0963548321000250
- By:
- Publication type:
- Article
Sharp concentration of the equitable chromatic number of dense random graphs.
- Published in:
- Combinatorics, Probability & Computing, 2020, v. 29, n. 2, p. 213, doi. 10.1017/S0963548319000397
- By:
- Publication type:
- Article
On the Chromatic Number of Random Cayley Graphs.
- Published in:
- Combinatorics, Probability & Computing, 2017, v. 26, n. 2, p. 248, doi. 10.1017/S0963548316000304
- By:
- Publication type:
- Article
Evaluations of Topological Tutte Polynomials.
- Published in:
- Combinatorics, Probability & Computing, 2015, v. 24, n. 3, p. 556, doi. 10.1017/S0963548314000571
- By:
- Publication type:
- Article
无K<sub>3</sub> 子图的图中1-因子计数.
- Published in:
- Journal of Dalian University of Technology / Dalian Ligong Daxue Xuebao, 2021, v. 61, n. 5, p. 546, doi. 10.7511/dllgxb202105014
- By:
- Publication type:
- Article
On regular hypergraphs with high girth and high chromatic number.
- Published in:
- Discrete Mathematics & Applications, 2015, v. 25, n. 5, p. 277, doi. 10.1515/dma-2015-0027
- By:
- Publication type:
- Article
CHROMATIC POLYNOMIAL OF SEMI-UNIFORM HYPERSTAR.
- Published in:
- Advances & Applications in Discrete Mathematics, 2019, v. 20, n. 2, p. 193, doi. 10.17654/DM020020193
- By:
- Publication type:
- Article
CHROMATIC POLYNOMIALS OF K<sub>m</sub> + P<sub>n</sub>, K<sub>m</sub> + C<sub>n</sub> AND G ◦ H.
- Published in:
- Advances & Applications in Discrete Mathematics, 2018, v. 19, n. 4, p. 445, doi. 10.17654/DM019040445
- By:
- Publication type:
- Article
EQUITABLE CHROMATIC NUMBER OF SOME WHEEL RELATED GRAPHS.
- Published in:
- Advances & Applications in Discrete Mathematics, 2017, v. 18, n. 4, p. 473, doi. 10.17654/DM018040473
- By:
- Publication type:
- Article
EQUITABLE COLORING OF CORONA PRODUCTS OF GRAPHS.
- Published in:
- Advances & Applications in Discrete Mathematics, 2013, v. 11, n. 2, p. 103
- By:
- Publication type:
- Article
Modular Chromatic Number of Certain Cyclic Graphs.
- Published in:
- Journal of Algebraic Statistics, 2022, v. 13, n. 3, p. 4459
- By:
- Publication type:
- Article
On b-chromatic Number of Prism Graph Families.
- Published in:
- Applications & Applied Mathematics, 2018, v. 13, n. 1, p. 286
- By:
- Publication type:
- Article
The Tutte polynomial of a class of compound graphs and its applications.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2023, v. 15, n. 1, p. 1, doi. 10.1142/S1793830922500586
- By:
- Publication type:
- Article
Chromatic Zagreb and irregularity polynomials of graphs.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2021, v. 13, n. 5, p. 1, doi. 10.1142/S1793830921500610
- By:
- Publication type:
- Article
2-Distance coloring of planar graph.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2021, v. 13, n. 2, p. N.PAG, doi. 10.1142/S1793830921500075
- By:
- Publication type:
- Article
Coloring squares of graphs via vertex orderings.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2021, v. 13, n. 1, p. N.PAG, doi. 10.1142/S1793830920500937
- By:
- Publication type:
- Article
Coloring 3-power of 3-subdivision of subcubic graph.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2018, v. 10, n. 3, p. N.PAG, doi. 10.1142/S1793830918500416
- By:
- Publication type:
- Article
The inverse sum indeg index of graphs with some given parameters.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2018, v. 10, n. 1, p. -1, doi. 10.1142/S1793830918500064
- By:
- Publication type:
- Article
Certain chromatic sums of some cycle-related graph classes.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2016, v. 8, n. 3, p. -1, doi. 10.1142/S1793830916500506
- By:
- Publication type:
- Article
On injective chromatic polynomials of graphs.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2015, v. 7, n. 3, p. -1, doi. 10.1142/S1793830915500354
- By:
- Publication type:
- Article
The list 2-distance coloring of a graph with Δ(G) = 5.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2015, v. 7, n. 2, p. -1, doi. 10.1142/S1793830915500172
- By:
- Publication type:
- Article
A graph associated with the set of all nonzero annihilating ideals of a commutative ring.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2014, v. 6, n. 4, p. -1, doi. 10.1142/S1793830914500475
- By:
- Publication type:
- Article
The Erdős-Faber-Lovász conjecture is true for n ≤ 12.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2014, v. 6, n. 3, p. -1, doi. 10.1142/S1793830914500396
- By:
- Publication type:
- Article
Disproof of the group coloring version of the Hadwiger conjecture.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2014, v. 6, n. 3, p. -1, doi. 10.1142/S1793830914500359
- By:
- Publication type:
- Article
Global dominating sets in minimum coloring.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2014, v. 6, n. 3, p. -1, doi. 10.1142/S179383091450044X
- By:
- Publication type:
- Article
TOTAL GRAPHS OF POLYNOMIAL RINGS AND RINGS OF FRACTIONS.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2013, v. 5, n. 4, p. -1, doi. 10.1142/S1793830913500353
- By:
- Publication type:
- Article
THE PROPORTIONAL COLORING PROBLEM: OPTIMIZING BUFFERS IN RADIO MESH NETWORKS.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2012, v. 4, n. 3, p. -1, doi. 10.1142/S1793830912500280
- By:
- Publication type:
- Article
Tutte Polynomials and Graph Symmetries.
- Published in:
- Symmetry (20738994), 2022, v. 14, n. 10, p. N.PAG, doi. 10.3390/sym14102072
- By:
- Publication type:
- Article
On Coloring Catalan Number Distance Graphs and Interference Graphs.
- Published in:
- Symmetry (20738994), 2018, v. 10, n. 10, p. 468, doi. 10.3390/sym10100468
- By:
- Publication type:
- Article
Classification of Algebraic Properties of Chromatic Polynomials.
- Published in:
- Journal of Scientific Research, 2013, v. 5, n. 3, p. 469, doi. 10.3329/jsr.v5i3.11634
- By:
- Publication type:
- Article
Affineness and chromatic homotopy theory.
- Published in:
- Journal of Topology, 2015, v. 8, n. 3, p. 476, doi. 10.1112/jtopol/jtv005
- By:
- Publication type:
- Article
Linear bounds on characteristic polynomials of matroids.
- Published in:
- Mathematical Proceedings of the Cambridge Philosophical Society, 2020, v. 168, n. 3, p. 505, doi. 10.1017/S0305004118000919
- By:
- Publication type:
- Article
The chromatic filtration of the Burnside category.
- Published in:
- Mathematical Proceedings of the Cambridge Philosophical Society, 2013, v. 154, n. 2, p. 287, doi. 10.1017/S0305004112000527
- By:
- Publication type:
- Article
A new method for calculating the chromatic polynomial.
- Published in:
- Applied Sciences, 2017, v. 19, p. 110
- By:
- Publication type:
- Article
Plane Bichromatic Trees of Low Degree.
- Published in:
- Discrete & Computational Geometry, 2018, v. 59, n. 4, p. 864, doi. 10.1007/s00454-017-9881-z
- By:
- Publication type:
- Article
The Density of Sets Avoiding Distance 1 in Euclidean Space.
- Published in:
- Discrete & Computational Geometry, 2015, v. 53, n. 4, p. 783, doi. 10.1007/s00454-015-9668-z
- By:
- Publication type:
- Article
Triangle-Free Geometric Intersection Graphs with No Large Independent Sets.
- Published in:
- Discrete & Computational Geometry, 2015, v. 53, n. 1, p. 221, doi. 10.1007/s00454-014-9645-y
- By:
- Publication type:
- Article
Coloring Triangle-Free Rectangle Overlap Graphs with $$O(\log \log n)$$ Colors.
- Published in:
- Discrete & Computational Geometry, 2015, v. 53, n. 1, p. 199, doi. 10.1007/s00454-014-9640-3
- By:
- Publication type:
- Article
Coloring $$d$$ -Embeddable $$k$$ -Uniform Hypergraphs.
- Published in:
- Discrete & Computational Geometry, 2014, v. 52, n. 4, p. 663, doi. 10.1007/s00454-014-9641-2
- By:
- Publication type:
- Article
On the Chromatic Number of $$\mathbb {R}^4$$.
- Published in:
- Discrete & Computational Geometry, 2014, v. 52, n. 2, p. 416, doi. 10.1007/s00454-014-9612-7
- By:
- Publication type:
- Article
Coloring Intersection Graphs of Arc-Connected Sets in the Plane.
- Published in:
- Discrete & Computational Geometry, 2014, v. 52, n. 2, p. 399, doi. 10.1007/s00454-014-9614-5
- By:
- Publication type:
- Article
Munsell and Ostwald colour spaces: A comparison in the field of hair colouring.
- Published in:
- Color Research & Application, 2023, v. 48, n. 1, p. 6, doi. 10.1002/col.22818
- By:
- Publication type:
- Article
Orthonormal Ultraspherical Operational Matrix Algorithm for Fractal-Fractional Riccati Equation with Generalized Caputo Derivative.
- Published in:
- Fractal & Fractional, 2021, v. 5, n. 3, p. 1, doi. 10.3390/fractalfract5030100
- By:
- Publication type:
- Article
On the Babai and Upper Chromatic Numbers of Graphs of Diameter 2.
- Published in:
- Tamkang Journal of Mathematics, 2021, v. 52, n. 1, p. 113, doi. 10.5556/j.tkjm.52.2021.3430
- By:
- Publication type:
- Article
INTRODUCTION TO DOMINATED EDGE CHROMATIC NUMBER OF A GRAPH.
- Published in:
- Opuscula Mathematica, 2021, v. 41, n. 2, p. 245, doi. 10.7494/OpMath.2021.41.2.245
- By:
- Publication type:
- Article
COLOURINGS OF (k-r, k)-TREES.
- Published in:
- Opuscula Mathematica, 2017, v. 37, n. 4, p. 491, doi. 10.7494/OpMath.2017.37.4.491
- By:
- Publication type:
- Article
SPANNING TREES WITH A BOUNDED NUMBER OF LEAVES.
- Published in:
- Opuscula Mathematica, 2017, v. 37, n. 4, p. 501, doi. 10.7494/OpMath.2017.37.4.501
- By:
- Publication type:
- Article
THE REGULAR GRAPH OF A NONCOMMUTATIVE RING.
- Published in:
- Bulletin of the Australian Mathematical Society, 2014, v. 89, n. 1, p. 132, doi. 10.1017/S0004972712001177
- By:
- Publication type:
- Article
Biased Expansions of Biased Graphs and Their Chromatic Polynomials.
- Published in:
- Annals of Combinatorics, 2012, v. 16, n. 4, p. 781, doi. 10.1007/s00026-012-0160-7
- By:
- Publication type:
- Article
A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable.
- Published in:
- Acta Mathematica Sinica, 2014, v. 30, n. 6, p. 993, doi. 10.1007/s10114-014-3170-z
- By:
- Publication type:
- Article