Results 11 to 20 of about 11,475 (265)
Finer Tight Bounds for Coloring on Clique-Width [PDF]
SIAM Journal on Discrete Mathematics, 2020 To appear in ICALP ...
Michael Lampis
exaly +9 more sources
Edge-clique graphs and the lambda-coloring problem [PDF]
Journal of the Brazilian Computer Society, 2001 This paper deals with edge-clique graphs and with the l-coloring problem when restricted to this class. A characterization of edge-clique graphs of out-erplanar graphs is given; a complete description of edge-clique graphs of threshold graphs is presented and a linear time algorithm for l-coloring the edge-clique graph of a threshold graph is provided.
Tiziana Calamoneri, Rossella Petreschi
openalex +7 more sources
Clique coloring of dense random graphs [PDF]
Journal of Graph Theory, 2017 AbstractThe clique chromatic number of a graph is the minimum number of colors in a vertex coloring so that no maximal (with respect to containment) clique is monochromatic. We prove that the clique chromatic number of the binomial random graph is, with high probability, . This settles a problem of McDiarmid, Mitsche, and Prałat who proved that it is
Noga Alon, Michael Krivelevich
openalex +4 more sources
Clique coloring $B_1$-EPG graphs [PDF]
, 2016 Fil: Bonomo, Flavia. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales.
Flavia Bonomo +2 more
openalex +7 more sources
Clique-Coloring Circular-Arc Graphs
Electronic Notes in Discrete Mathematics, 2009 Abstract A clique-coloring of a graph is a coloring of its vertices such that no maximal clique of size at least two is monochromatic. A circular-arc graph is the intersection graph of a family of arcs in a circle. We show that every circular-arc graph is 3-clique-colorable.
Márcia R. Cerioli +1 more
openaire +3 more sources
Reducing hypergraph coloring to clique search
Discrete Applied Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sándor Szabó, Bogdán Zaválnij
openalex +3 more sources
(Delta+1) Coloring in the Congested Clique Model
, 2018 Comment: Appeared in ICALP'18 (the update version adds a missing part in the deterministic coloring procedure)
Merav Parter
openalex +5 more sources
A local core number based algorithm for the maximum clique problem [PDF]
Transactions on Combinatorics, 2021 The maximum clique problem (MCP) is to determine a complete subgraph of maximum cardinality in a graph. MCP is a fundamental problem in combinatorial optimization and is noticeable for its wide range of applications.
Neda Mohammadi, Mehdi Kadivar
doaj +1 more source
Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph [PDF]
Neutrosophic Sets and Systems, 2022 New setting is introduced to study dominating, resolving, coloring, Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian) neutrosophic path, zero forcing number, zero forcing neutrosophicnumber, independent number, independent neutrosophic ...
Henry Garrett
doaj +1 more source