Partial covers of graphs

DOI10.7151/DMGT.1159MaRDI QIDQ4786790zbMATH OpenOpenAlexWikidataFDO

Authors Jiří Fiala, Jan Kratochvíl

Publication date 21 August 2003

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1159

zbMATH Keywords

computational complexitygraph homomorphismlambda coloring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• scientific article; zbMATH DE number 2081019
• Covering regular graphs
• scientific article; zbMATH DE number 1236360
• Locally constrained graph homomorphisms -- structure, complexity, and applications
• scientific article; zbMATH DE number 1953094

Cited in

(33)

• On Injective Colourings of Chordal Graphs
• BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
• Locally injective k-colourings of planar graphs
• Distance three labelings of trees
• Comparing Universal Covers in Polynomial Time
• NP completeness of the edge precoloring extension problem on bipartite graphs
• Locally injective homomorphism to the simple weight graphs
• Computing role assignments of proper interval graphs in polynomial time
• The complexity of locally injective homomorphisms
• scientific article; zbMATH DE number 2081019 (Why is no real title available?)
• Graph labelings derived from models in distributed computing: A complete complexity classification
• An algorithmic framework for locally constrained homomorphisms
• Partial and perfect path covers of cographs
• Computing role assignments of proper interval graphs in polynomial time
• Computing role assignments of chordal graphs
• A complete complexity classification of the role assignment problem
• Comparing universal covers in polynomial time
• Complexity of locally injective homomorphism to the Theta graphs
• Mixed hypergraphs and other coloring problems
• Locally constrained graph homomorphisms -- structure, complexity, and applications
• Locally constrained graph homomorphisms and equitable partitions
• scientific article; zbMATH DE number 5011088 (Why is no real title available?)
• Cantor--Bernstein type theorem for locally constrained graph homomorphisms
• List covering of regular multigraphs
• On distance constrained labeling of disk graphs
• scientific article; zbMATH DE number 3972916 (Why is no real title available?)
• An algorithmic framework for locally constrained homomorphisms
• Exact algorithms for \(L(2,1)\)-labeling of graphs
• Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
• Partial covering of hypergraphs
• Distance Constrained Labelings of Trees
• On the computational complexity of partial covers of theta graphs
• List covering of regular multigraphs with semi-edges

This page was built for publication: Partial covers of graphs

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