Thinness of product graphs

DOI10.1016/J.DAM.2021.04.003zbMATH Open1485.05049OpenAlexW3158345611MaRDI QIDQ831864FDOQ831864

Authors: Flavia Bonomo, Fabiano S. Oliveira, Moysés S. Jr. Sampaio, Carolina Lucía Gonzalez, Jayme L. Szwarcfiter 

Publication date: 24 March 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.04.003

Recommendations

• The thickness of the Kronecker product of graphs
• The thickness of the Cartesian product of two graphs
• The thickness of some Cartesian product graphs.
• On the thinness and proper thinness of a graph
• The thickness of amalgamations and Cartesian product of graphs
• Thickness and Antithickness of Graphs
• The well-covered dimension of products of graphs
• Linearity of graph products
• On a product dimension of bipartite graphs
• Wide-diameter of product graphs

zbMATH Keywords

graph operationsproduct graphsthinnesscomplete thinnessindependent thinnessproper thinness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76) Graph theory (05C99)

Cites Work

• Quantum homomorphisms
• Complement reducible graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Independence and coloring properties of direct products of some vertex-transitive graphs
• Grundy number and products of graphs
• Game chromatic number of Cartesian product graphs
• The fractional version of Hedetniemi's conjecture is true
• The complexity of comparability graph recognition and coloring
• Topics in graph theory. Graphs and their Cartesian product
• Vertex-transitive graphs
• The chromatic number and other functions of the lexicographic product
• Some bounds for the \(b\)-chromatic number of a graph
• On the b-chromatic number of some graph products
• An optimal greedy heuristic to color interval graphs
• Optimal labelling of a product of two paths
• Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
• The b -chromatic number of the cartesian product of two graphs
• Title not available (Why is that?)
• A new property of critical imperfect graphs and some consequences
• New bounds on the Grundy number of products of graphs
• Counterexamples to Hedetniemi's conjecture
• The stable set problem and the thinness of a graph
• Interval-regular graphs
• \(k\)-tuple colorings of the Cartesian product of graphs
• Coloring graph products---a survey
• Achromatic numbers and graph operations
• Boxicity and cubicity of product graphs
• The \(b\)-chromatic index of direct product of graphs
• On the thinness and proper thinness of a graph
• Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees
• Title not available (Why is that?)

Cited In (7)

• On the thinness of trees
• Thinness of product graphs
• Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
• Solving problems on generalized convex graphs via mim-width
• On the thinness and proper thinness of a graph
• Thinness and its variations on some graph families and coloring graphs of bounded thinness
• Precedence thinness in graphs

This page was built for publication: Thinness of product graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831864)