We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:

Search Results

Showing 1-20 of 133 results
  1. The Dichromatic Polynomial of a Digraph

    D. González-Moreno, R. Hernández-Ortiz, ... M. Olsen in Graphs and Combinatorics
    Article 16 April 2022
  2. On the Dichromatic Number of Surfaces

    In this paper, we give bounds on the dichromatic number $$\overrightarrow{\chi...
    Pierre Aboulker, Frédéric Havet, ... Clément Rambaud in Extended Abstracts EuroComb 2021
    Conference paper 2021
  3. On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs

    We prove that every 4-dicritical oriented graph on n vertices has at least...
    Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud in Graph-Theoretic Concepts in Computer Science
    Conference paper 2023
  4. Decomposing and Colouring Locally Out-Transitive Oriented Graphs

    We study the dichromatic number of a digraph, defined as the minimum number of parts in a partition of its vertex set into acyclic induced...
    Pierre Aboulker, Guillaume Aubian, Pierre Charbit in Extended Abstracts EuroComb 2021
    Conference paper 2021
  5. The Minimum Number of Edges in 4-Critical Digraphs of Given Order

    Alexandr V. Kostochka, Michael Stiebitz in Graphs and Combinatorics
    Article 15 February 2020
  6. The Potts Model, the Jones Polynomial and Link Homology

    In the paper we explore how the Potts model in statistical mechanics is related to the Temperley-Lieb algebra, the Jones polynomial and Khovanov...
    Chapter 2022
  7. Critical Graphs with few Edges

    This chapter is concerned with the minimum number ext(k,n) of edges in k-critical graphswith n vertices. Brooks’ theorem says that 2ext(k,n) ≥ (k...
    Michael Stiebitz, Thomas Schweser, Bjarne Toft in Brooks' Theorem
    Chapter 2024
  8. The Chromatic Polynomial of a Digraph

    An acyclic coloring of a digraph as defined by V. Neumann-Lara is a vertex-coloring such that no monochromatic directed cycles occur. Counting the...
    Chapter 2021
  9. Edge colourings and qualitative representations of chromatic algebras

    Conventional Ramsey-theoretic investigations for edge-colourings of complete graphs are framed around avoidance of certain configurations. Motivated...

    Badriah Al-Juaid, Marcel Jackson, ... Tomasz Kowalski in Journal of Algebraic Combinatorics
    Article Open access 13 June 2023
  10. Colorings and Orientations of Graphs

    Colorings and orientations of graphs are related in different ways, but the deepness of these relations is notwell understood. In this chapter we...
    Michael Stiebitz, Thomas Schweser, Bjarne Toft in Brooks' Theorem
    Chapter 2024
  11. Properties of Critical Graphs

    In this chapterwe shall continue the study of critical graphs.Critical graphswere first introduced and investigated by G. A. Dirac in his doctoral...
    Michael Stiebitz, Thomas Schweser, Bjarne Toft in Brooks' Theorem
    Chapter 2024
  12. Relation of knot theories in some 3-manifolds to planar 1-polar knot diagrams

    We relate equivalences of loops and arcs in some three manifolds to equivalences of various kinds of 1-polar knot diagrams on some subsets of a...

    Bataineh Khaled, Kodokostas Dimitrios in manuscripta mathematica
    Article 23 April 2024
  13. From Knot Invariants to Knot Dynamics

    This paper is an introduction to combinatorial topology via state summation models for the Jones polynomial and its generalizations and also an...
    Louis H. Kauffman in Knotted Fields
    Chapter 2024
  14. Helmholtz and the geometry of color space: gestation and development of Helmholtz’s line element

    Modern color science finds its birth in the middle of the nineteenth century. Among the chief architects of the new color theory, the name of the...

    Giulio Peruzzi, Valentina Roberti in Archive for History of Exact Sciences
    Article Open access 17 January 2023
  15. Point Partition Numbers: Perfect Graphs

    Justus von Postel, Thomas Schweser, Michael Stiebitz in Graphs and Combinatorics
    Article 01 February 2022
  16. On Inducing Degenerate Sums Through 2-Labellings

    We deal with a variant of the 1–2–3 Conjecture introduced by Gao, Wang, and Wu (Graphs Combin 32:1415–1421, 2016) . This variant asks whether all...

    Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille in Graphs and Combinatorics
    Article 09 February 2024
  17. From Friezes to Quasicrystals: A History of Symmetry Groups

    Even if, since many thousands of years, humans were fascinated by symmetry, which is reflected in many preserved ornaments on buildings, paintings,...
    Franka Miriam Brückler, Vladimir Stilinović in Handbook of the History and Philosophy of Mathematical Practice
    Living reference work entry 2024
  18. From Friezes to Quasicrystals: A History of Symmetry Groups

    Even if, since many thousands of years, humans were fascinated by symmetry, which is reflected in many preserved ornaments on buildings, paintings,...
    Franka Miriam Brückler, Vladimir Stilinović in Handbook of the History and Philosophy of Mathematical Practice
    Reference work entry 2024
  19. Dynamic Resource Allocation Networks in Marketing: Comparing the Effectiveness of Control Methods

    The discrete- and continuous-time network models of opinions control and resource allocation in marketing are considered. Three cases of interaction...

    N. M. Galieva, A. V. Korolev, G. A. Ougolnitsky in Dynamic Games and Applications
    Article 13 March 2023
  20. Coloring of Hypergraphs

    Hypergraphs are discrete structures that generalize graphs in a very natural way. While in a graph every edge is incident with exactly two vertices,...
    Michael Stiebitz, Thomas Schweser, Bjarne Toft in Brooks' Theorem
    Chapter 2024
Did you find what you were looking for? Share feedback.