Clique coloring EPT graphs on bounded degree trees

DOI10.33044/REVUMA.3511MaRDI QIDQ6995853zbMATH OpenFDO

Authors Pablo De Caria, M. P. Mazzoleni, María Guadalupe Payo Vidal

Publication date 17 April 2025

Published in Revista de la Unión Matemática Argentina (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33044/REVUMA.3511

zbMATH Keywords

clique coloringEPT graphsEPT-star graphsintersection graphs

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Cites work

• Clique-coloring circular-arc graphs
• Clique-coloring UE and UEH graphs
• Clique-transversal sets of line graphs and complements of line graphs
• Coloring the cliques of line graphs
• Coloring the Maximal Cliques of Graphs
• Colouring clique-hypergraphs of circulant graphs
• Constant tolerance intersection graphs of subtrees of a tree
• Edge and vertex intersection of paths in a tree
• EPT graphs on bounded degree trees
• Fibres and ordered set coloring
• Graph theory
• On rigid circuit graphs
• On the complexity of bicoloring clique hypergraphs of graphs
• Perfect graphs of arbitrarily large clique-chromatic number
• Representing edge intersection graphs of paths on degree 4 trees
• Resource allocation problems in multifiber WDM tree networks.
• Sur le coloriage des graphs
• The edge intersection graphs of paths in a tree
• Topics in Intersection Graph Theory
• Two-colouring all two-element maximal antichains

This page was built for publication: Clique coloring EPT graphs on bounded degree trees

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